scholarly journals Quality Improvement for Exemplar-based Image Inpainting using a Modified Searching Mechanism

2020 ◽  
Vol 4 (1) ◽  
pp. 1
Author(s):  
Mariwan Wahid Ahmed ◽  
Alan Anwer Abdulla
Keyword(s):  
Image Processing ◽  
Image Compression ◽  
Euclidean Distance ◽  
Image Inpainting ◽  
Input Image ◽  
Second Step ◽  
Research Areas ◽  
Potential Applications ◽  
Priority Function ◽  
Popular Images

Digital image processing has a significant impact in different research areas including medical image processing, biometrics, image inpainting, object detection, information hiding, and image compression. Image inpainting is a science of reconstructing damaged parts of digital images and filling-in regions in which information are missing which has many potential applications such as repairing scratched images, removing unwanted objects, filling missing area, and repairing old images. In this paper, an image inpainting algorithm is developed based on exemplar, which is one of the most important and popular images inpainting technique, to fill-in missing area that caused either by removing unwanted objects, by image compression, by scratching image, or by image transformation through internet. In general, image inpainting consists of two main steps: The first one is the priority function. In this step, the algorithm decides to select which patch has the highest priority to be filled at the first. The second step is the searching mechanism to find the most similar patch to the selected highest priority patch to be inpainted. This paper concerns the second step and an improved searching mechanism is proposed to select the most similar patch. The proposed approach entails three steps: (1) Euclidean distance is used to find the similarity between the highest priority patches which need to be inpainted with each patch of the input image, (2) the position/location distance between those two patches is calculated, and (3) the resulted value from the first step is summed with the resulted value obtained from the second step. These steps are repeated until the last patch from the input image is checked. Finally, the smallest distance value obtained in step 3 is selected as the most similar patch. Experimental results demonstrated that the proposed approach gained a higher quality in terms of both objectives and subjective compared to other existing algorithms.

Technique for Text Region Detection in Image Processing

2017 ◽  
Vol 7 (7) ◽  
pp. 68
Author(s):  
. Shivani ◽  
Dipti Bansal
Keyword(s):  
Image Processing ◽  
Deep Learning ◽  
Input Image ◽  
Second Step ◽  
Digital Information ◽  
Sift Algorithm ◽  
Region Detection ◽  
Base Paper ◽  
Key Points ◽  
Back Ground

The image processing is the technique which is applied to process the digital information stored in the image. The OCR is the technique of image processing which will access the optical character information in the image. In the base paper, the technique is applied which will detect the text portion from the input image. The twp step are applied to detect the text portion, in the first back ground information is extracted and in the second step, technique of deep learning is applied which will mark the text region. In the proposed work, SIFT algorithm is applied which will mark the key points for the key description. In the second step, technique of deep learning is applied which will mark the text area in the input image. The proposed and existing algorithms are implemented in MATLAB and it is been analyzed that accuracy of proposed algorithm is more as compared to existing algorithm.

Vehicle Classification Using Advanced Technologies

1996 ◽  
Vol 1551 (1) ◽  
pp. 45-50
Author(s):  
Chien-Hung Wei ◽  
Cheng-Chih Chang ◽  
Sheng-Shih Wang
Keyword(s):  
Neural Networks ◽  
Image Processing ◽  
Research Process ◽  
Vehicle Classification ◽  
Ann Model ◽  
Traffic Pattern ◽  
Research Areas ◽  
Advanced Technologies ◽  
Potential Applications ◽  
Hidden Layer

Applying advanced technologies to existing problem domains is a highly desirable approach in many research areas. Among these techniques, image processing has been shown useful in transportation fields for such tasks as traffic pattern recognition, data collection, accident detection, and pavement evaluation. The integrated model with artificial neural networks (ANNs) has promising potential applications. The image processing and ANN model are combined to explore the feasibility of vehicle classification in real-world situations. Three methods were developed during the research process: ground segmentation, background subtraction, and window segmentation. The first two methods were used to separate the objects of scene and nonscene from the actual traffic image. To reduce the complexity of neural networks, the image was divided into 16 windows and three characteristics (occupation rates of vehicles, of horizontal image lines, and of vertical image lines) of each window were extracted to generate 48 factors as the input units of the neural network. The backpropagation ANN model with one hidden layer is employed. The experiments show that the accurate recognition rates of heavy vehicles, small cars, and motorcycles are 98.5, 96.92, and 91.94 percent, respectively. The result implies the remarkable applicability of the proposed methods in transportation areas.

scholarly journals Review of Inpainting Algorithms for Wireless Communication Application

2020 ◽  
Vol 10 (3) ◽  
pp. 5790-5795
Author(s):  
V. Yatnalli ◽  
B. G. Shivaleelavathi ◽  
K. L. Sudha
Keyword(s):  
Image Processing ◽  
Computer Vision ◽  
Wireless Communication ◽  
Image Compression ◽  
Image Restoration ◽  
Digital Image ◽  
Image Inpainting ◽  
Wireless Channel ◽  
Image Recovery

Digital image inpainting is a technique of restoring large removed /damaged regions of an image with the data from the surrounding pixels of the removed region. The issue of image restoration with inpainting techniques occurs commonly in computer vision/image processing when unwanted objects have to be removed from images, for filling cracks in photographs, etc. Digital image inpainting approach is an active field of research in two significant applications of wireless communication: image compression and image recovery from a damaged image due to errors in a wireless channel. This work presents a brief survey of different image inpainting techniques and their contributions to different wireless communication applications.

A Comparative Study of Ant and Genetic Algorithms in Digital Mammography

2018 ◽  
pp. 194-200
Author(s):  
J. Magelin Mary ◽  
Chitra K. ◽  
Y. Arockia Suganthi
Keyword(s):  
Genetic Algorithm ◽  
Image Processing ◽  
Medical Image ◽  
Medical Image Processing ◽  
Processing Technique ◽  
Input Image ◽  
Image Processing Technique ◽  
Computational Time ◽  
Image Mining ◽  
The Individual

Image processing technique in general, involves the application of signal processing on the input image for isolating the individual color plane of an image. It plays an important role in the image analysis and computer version. This paper compares the efficiency of two approaches in the area of finding breast cancer in medical image processing. The fundamental target is to apply an image mining in the area of medical image handling utilizing grouping guideline created by genetic algorithm. The parameter using extracted border, the border pixels are considered as population strings to genetic algorithm and Ant Colony Optimization, to find out the optimum value from the border pixels. We likewise look at cost of ACO and GA also, endeavors to discover which one gives the better solution to identify an affected area in medical image based on computational time.

scholarly journals A Projected Forward-Backward Algorithm for Constrained Minimization with Applications to Image Inpainting

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 890
Author(s):  
Suthep Suantai ◽  
Kunrada Kankam ◽  
Prasit Cholamjiak
Keyword(s):  
Image Processing ◽  
Minimization Problem ◽  
Convex Functions ◽  
Lower Semicontinuous ◽  
Image Inpainting ◽  
Constrained Minimization ◽  
Convex Minimization Problem ◽  
Mild Conditions ◽  
Constrained Minimization Problem ◽  
Weak Convergence Theorem

In this research, we study the convex minimization problem in the form of the sum of two proper, lower-semicontinuous, and convex functions. We introduce a new projected forward-backward algorithm using linesearch and inertial techniques. We then establish a weak convergence theorem under mild conditions. It is known that image processing such as inpainting problems can be modeled as the constrained minimization problem of the sum of convex functions. In this connection, we aim to apply the suggested method for solving image inpainting. We also give some comparisons to other methods in the literature. It is shown that the proposed algorithm outperforms others in terms of iterations. Finally, we give an analysis on parameters that are assumed in our hypothesis.

Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks

2000 ◽  
Vol 32 (01) ◽  
pp. 1-18 ◽  
Author(s):  
F. Baccelli ◽  
K. Tchoumatchenko ◽  
S. Zuyev
Keyword(s):  
Communication Networks ◽  
Mobile Networks ◽  
Path Length ◽  
Euclidean Distance ◽  
Voronoi Tessellation ◽  
Voronoi Cells ◽  
Ergodic Properties ◽  
Potential Applications ◽  
The Mean ◽  
Mobile Communication Networks

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and find its stationary distribution. As a corollary, we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to define a family of simple incremental algorithms for constructing short paths on the Delaunay graph and discuss potential applications to routeing in mobile communication networks.

scholarly journals Fast Transforms in Image Processing: Compression, Restoration, and Resampling

2014 ◽  
Vol 2014 ◽  
pp. 1-23 ◽  
Author(s):  
Leonid P. Yaroslavsky
Keyword(s):  
Image Processing ◽  
Image Compression ◽  
Image Restoration ◽  
Compressive Sensing ◽  
Adaptive Filters ◽  
Processing Methods ◽  
Fast Transforms ◽  
Image Transforms

Transform image processing methods are methods that work in domains of image transforms, such as Discrete Fourier, Discrete Cosine, Wavelet, and alike. They proved to be very efficient in image compression, in image restoration, in image resampling, and in geometrical transformations and can be traced back to early 1970s. The paper reviews these methods, with emphasis on their comparison and relationships, from the very first steps of transform image compression methods to adaptive and local adaptive filters for image restoration and up to “compressive sensing” methods that gained popularity in last few years. References are made to both first publications of the corresponding results and more recent and more easily available ones. The review has a tutorial character and purpose.

Quantum generative adversarial networks for learning and loading quantum image in noisy environment

2021 ◽  
pp. 2150360
Author(s):  
Wanghao Ren ◽  
Zhiming Li ◽  
Yiming Huang ◽  
Runqiu Guo ◽  
Lansheng Feng ◽  
...  
Keyword(s):  
Image Processing ◽  
Quantum Circuit ◽  
Quantum Image Processing ◽  
Quantum Circuits ◽  
Generative Adversarial Networks ◽  
Channel Noise ◽  
Quantum Image ◽  
Adversarial Networks ◽  
Potential Applications ◽  
Classical Image

Quantum machine learning is expected to be one of the potential applications that can be realized in the near future. Finding potential applications for it has become one of the hot topics in the quantum computing community. With the increase of digital image processing, researchers try to use quantum image processing instead of classical image processing to improve the ability of image processing. Inspired by previous studies on the adversarial quantum circuit learning, we introduce a quantum generative adversarial framework for loading and learning a quantum image. In this paper, we extend quantum generative adversarial networks to the quantum image processing field and show how to learning and loading an classical image using quantum circuits. By reducing quantum gates without gradient changes, we reduced the number of basic quantum building block from 15 to 13. Our framework effectively generates pure state subject to bit flip, bit phase flip, phase flip, and depolarizing channel noise. We numerically simulate the loading and learning of classical images on the MINST database and CIFAR-10 database. In the quantum image processing field, our framework can be used to learn a quantum image as a subroutine of other quantum circuits. Through numerical simulation, our method can still quickly converge under the influence of a variety of noises.

scholarly journals Lung Cancer Detection using Convolutional Neural Network

2019 ◽  
Vol 8 (6) ◽  
pp. 3256-3262 ◽  
Keyword(s):  
Lung Cancer ◽  
Image Processing ◽  
Detection System ◽  
Histogram Equalization ◽  
Input Image ◽  
Machine Learning Algorithms ◽  
Morphological Operations ◽  
Image Processing Techniques ◽  
Cad System ◽  
Processing Techniques

The mortality rate is increasing among the growing population and one of the leading causes is lung cancer. Early diagnosis is required to decrease the number of deaths and increase the survival rate of lung cancer patients. With the advancements in the medical field and its technologies CAD system has played a significant role to detect the early symptoms in the patients which cannot be carried out manually without any error in it. CAD is detection system which has combined the machine learning algorithms with image processing using computer vision. In this research a novel approach to CAD system is presented to detect lung cancer using image processing techniques and classifying the detected nodules by CNN approach. The proposed method has taken CT scan image as input image and different image processing techniques such as histogram equalization, segmentation, morphological operations and feature extraction have been performed on it. A CNN based classifier is trained to classify the nodules as cancerous or non-cancerous. The performance of the system is evaluated in the terms of sensitivity, specificity and accuracy

scholarly journals PENERAPAN CITRA TERKOMPRESI PADA SEGMENTASI CITRA MENGGUNAKAN ALGORITMA K-MEANS

2018 ◽  
Vol 2 (1) ◽  
pp. 65-74
Author(s):  
Angga Wijaya Kusuma ◽  
Rossy Lydia Ellyana
Keyword(s):  
Image Processing ◽  
Image Segmentation ◽  
Medical Image ◽  
Performance Test ◽  
Input Image ◽  
Magnetic Resonance Imaging Image ◽  
Resonance Imaging ◽  
Compression Process ◽  
Mri Brain ◽  
Mri Image

In the development of an image not only as a documentation of events. One area that requires image processing is in the field of medicine is radiology. In radiology there is a medical image required by doctors and researchers to be processed for patient analysis. One of the important problems in image processing and pattern recognition is image segmentation into homogeneous areas. Segmentation in medical images will result in a medical image with area boundaries that are important information for analysis. This research applies k-means algorithm to MRI (Magnetic Resonance Imaging) image segmentation. The input image used is the image of MRI (brain and breast) has gone through the compression stage. This compression process is done with the aim of reducing memory usage but the critical information content of MRI image is still maintained. The image of the segmentation result is evaluated through performance test using GCE, VOI, MSE, and PSNR parameters.

Sign in / Sign up

Export Citation Format

Share Document