Scaling of Engineering Image Based on Interpolation Algorithm

2013 ◽  
Vol 634-638 ◽  
pp. 3989-3993
Author(s):  
Hui Wang ◽  
Guo Jia Li ◽  
Jun Hui Pan
Keyword(s):  
Image Quality ◽  
Experimental Results ◽  
Interpolation Algorithm ◽  
Bilinear Interpolation ◽  
Large Capacity ◽  
Image Scaling

Before the large capacity and engineering image is analyzed carefully, which need to be effective scaled. The subsequent analysis and calculation to engineering image is subjected by image quality and scaling time. According to scaling research of large capacity engineering image, the effect for image scaling by various interpolation algorithm is individual analyzed, and more appropriate algorithm is selected. The experimental results show that the engineering image of best effect is got, when it is high-expansion scaled by double cubic interpolation, and the bilinear interpolation is more suitable for low multiple scaling image.

Bilinear Interpolation Image Scaling Processor for VLSI Architecure

2014 ◽  
Vol 3 (3) ◽  
pp. 104 ◽  
Author(s):  
Pawar Ashwini Dilip ◽  
K Rameshbabu ◽  
Kanase Prajakta Ashok ◽  
Shital Arjun Shivdas
Keyword(s):  
Vlsi Architecture ◽  
Spatial Filter ◽  
Cmos Process ◽  
Interpolation Algorithm ◽  
Bilinear Interpolation ◽  
Hardware Cost ◽  
Image Scaling ◽  
Memory Buffer ◽  
Convolution Kernels ◽  
Calculation Unit

We introduce image scaling processor using VLSI technique. It consist of Bilinear interpolation, clamp filter and  a sharpening spatial filter. Bilinear interpolation algorithm is popular due to its computational efficiency and  image quality. But resultant image consist of blurring edges and aliasing artifacts after scaling. To reduce the blurring and aliasing artifacts sharpening spatial filter and clamp filters are used as pre-filter. These filters are realized by using T-model and inversed T-model convolution kernels. To reduce the memory buffer and computing resources for proposed image processor design two T-model or inversed T-model filters are combined into combined filter which requires only one line buffer memory. Also, to reduce hardware cost Reconfigurable calculation unit (RCU)is invented. The VLSI architecture in this work can achieve 280 MHz with 6.08-K gate counts, and its core area is 30 378 <em>μ</em>m2 synthesized by a 0.13-<em>μ</em>m CMOS process.

An Improved Texture Compression Method for Graphics Hardware

2011 ◽  
Vol 63-64 ◽  
pp. 444-448
Author(s):  
Hai Ying Chen ◽  
Yin Yin Zhou
Keyword(s):  
Image Quality ◽  
Experimental Results ◽  
Graphics Hardware ◽  
Bilinear Interpolation ◽  
Compression Method ◽  
Compression Scheme ◽  
High Image Quality

In this paper, we proposed an improved texture compression method for graphics hardware. We first give a detail introduction for the texture compression methods which are popular now. Then, an MIPMap-based texture compression method is proposed that is hybrid compression scheme. For smooth area, we can only use 2Bytes to represent the 4*4 pixels block by bilinear interpolation. Otherwise, we will use iPACKMAN algorithm to deal with the noise areas. Actually, this method is feasible to be implemented by hardware since it is very simple. Experimental results show that our method can achieve high compress ratio and high image quality.

Video image scaling technology based on adaptive interpolation algorithm and TTS FPGA implementation

2021 ◽  
Vol 76 ◽  
pp. 103516
Author(s):  
Guangyu Liu ◽  
Bao Zhou ◽  
Yi Huang ◽  
Longfei Wang ◽  
Wei Wang ◽  
...  
Keyword(s):  
Fpga Implementation ◽  
Video Image ◽  
Interpolation Algorithm ◽  
Image Scaling ◽  
Adaptive Interpolation

FPGA Implementation of the Bilinear Interpolation Algorithm for Image Demosaicking

2009 ◽  
Author(s):  
Ivan Olaf Hernandez Fuentes ◽  
Miguel Enrique Bravo-Zanoguera ◽  
Guillermo Galaviz Yanez
Keyword(s):  
Fpga Implementation ◽  
Interpolation Algorithm ◽  
Bilinear Interpolation

Blind Digital Image Watermarking Algorithm Based on the Chain Code

2012 ◽  
Vol 546-547 ◽  
pp. 410-415
Author(s):  
Chun Ge Tang ◽  
Tie Sheng Fan ◽  
Lei Liu ◽  
Zhi Hui Li
Keyword(s):  
Image Quality ◽  
Digital Watermarking ◽  
Digital Image ◽  
Image Watermarking ◽  
Boundary Representation ◽  
Experimental Results ◽  
Digital Image Watermarking ◽  
Original Image ◽  
Chain Code ◽  
Decision Method

A new blind digital watermarking algorithm based on the chain code is proposed. The chain code is obtained by the characteristics of the original image -the edge contour. The feather can reflect the overall correlation of the vector image, and chain code expression can significantly reduce the boundary representation of the amount of data required. For the watermarking embedding, the original vector image is divided into sub-block images, and two bits of the watermarking information are embedded into sub-block images repeatedly by quantization. For watermarking extracting, the majority decision method is employed to determine the size of the extracted watermark. Experimental results show that the image quality is not significantly lowered after watermarking. The algorithm can resist the basic conventional attacks and has good robustness on the shear attacks.

scholarly journals A Location Map Reduced Reversible Data Hiding Method Using Prediction Error Modification

2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Cover Image ◽  
Prediction Errors ◽  
Secret Data ◽  
Location Map ◽  
Comparable Image Quality

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.

scholarly journals Simulation of the preparation and face drilling processes with laser scanning and automated marking of the drilling grid

2020 ◽  
Vol 177 ◽  
pp. 01010 ◽  
Author(s):  
Evgeniya Volkova ◽  
Aleksey Druzhinin ◽  
Roman Kuzminykh ◽  
Vladimir Poluzadov
Keyword(s):  
Software Development ◽  
Laser Scanning ◽  
3D Model ◽  
Drilling Process ◽  
Interpolation Algorithm ◽  
Laser Rangefinder ◽  
Bilinear Interpolation ◽  
The Face ◽  
Polygonal Model ◽  
Grid Based

The article discusses the methods of calculating the drilling and blasting scheme and constructing a drilling grid, manual and automatic calculation options are compared. A method for automatically constructing a drilling grid based on laser scanning is proposed. Moreover, the proposed method can be implemented using cheap equipment - a laser rangefinder and an Arduino microcomputer. Based on the data of the laser rangefinder with openCV and SciPy libraries, a polygonal 3D model of the face is built. The transfer of the drilling grid to the 3D model is implemented using the bilinear interpolation algorithm. The constructed polygonal model can be improved by making changes to the construction algorithm, since it is developed by the authors and can be further developed. The simulation model is created in Anylogic software and shows the drilling process taking into account the previously calculated drilling pattern. The proposed models can be used as a basis for further research and software development.

Crack Grid Detection and Calculation Based on Convolutional Neural Network

2021 ◽  
Author(s):  
Liyang Xiao ◽  
Wei Li ◽  
Ju Huyan ◽  
Zhaoyun Sun ◽  
Susan Tighe
Keyword(s):  
Neural Network ◽  
Image Quality ◽  
Convolutional Neural Network ◽  
Image Denoising ◽  
Crack Detection ◽  
Experimental Results ◽  
Crack Identification ◽  
Threshold Segmentation ◽  
Improve Image Quality

This paper aims to develop a method of crack grid detection based on convolutional neural network. First, an image denoising operation is conducted to improve image quality. Next, the processed images are divided into grids of different, and each grid is fed into a convolutional neural network for detection. The pieces of the grids with cracks are marked and then returned to the original images. Finally, on the basis of the detection results, threshold segmentation is performed only on the marked grids. Information about the crack parameters is obtained via pixel scanning and calculation, which realises complete crack detection. The experimental results show that 30×30 grids perform the best with the accuracy value of 97.33%. The advantage of automatic crack grid detection is that it can avoid fracture phenomenon in crack identification and ensure the integrity of cracks.

Sign in / Sign up

Export Citation Format

Share Document