Area-Efficient Two-Dimensional Separable Convolution Structure

2019 ◽  
Vol 63 (5) ◽  
pp. 50404-1-50404-4
Author(s):  
Hyeonkyu Kim ◽  
Hoyoung Yoo
Keyword(s):  
Image Processing ◽  
Power Consumption ◽  
Significant Role ◽  
Processing System ◽  
Two Dimensional ◽  
Hardware Complexity ◽  
One Dimensional ◽  
Convolution Structure ◽  
The One ◽  
Area Efficient

Abstract In a recent image processing system, convolution operations play a significant role in manipulating image and extracting features from images. Due to the increase of kernel sizes, the image processing hardware suffers from severe hardware complexity and power consumption. In this article, an area-efficient structure is proposed for two-dimensional separable convolution operations. Since a separable convolution allows to translate a two-dimensional convolution into two one-dimensional convolutions, it is possible to compute row-wise and column-wise convolutions independently. Whereas the previous work performs such one-dimensional convolutions in sequence, the proposed structure computes the one-dimensional convolutions simultaneously by rescheduling the computational sequence. Experimental results show that the proposed structure saves approximately 80% and 38% of the hardware resources compared to the conventional and previous structures, respectively.

scholarly journals Distributed image processing based on the same IP-cores in FPGA-architecture

2019 ◽  
pp. 126-133
Author(s):  
V M Zakharov ◽  
S V Shalagin ◽  
B F Eminov
Keyword(s):  
Parallel Implementation ◽  
Single Type ◽  
Two Dimensional ◽  
Hardware Complexity ◽  
Data Array ◽  
One Dimensional ◽  
Fpga Architecture ◽  
Programmable Architecture ◽  
Ip Cores ◽  
The One

The problem of processing images, i. e., two-dimensional data arrays, was solved through implementing two-dimensional fast Fourier transform (FFT) when using single-type hardware modules – IP-cores in the Virtex-6 FPGA architecture. We have shown the possibility of the parallel implementation of each stage in the two-dimensional FFT, based on four “butterfly”-type transforms (BTr) over four elements of the data array being processed. Estimations were obtained regarding time- and hardware complexity of the IPcore implementing BTrs and used in implementing the one-dimensional FFT. The results obtained can be used in estimating hardware and time consumption when performing a twodimensional FFT over an array of the pre-defined dimensionality in using existing and forthcoming distributed programmable-architecture systems.

Nonlinear average stochastic resonance for image enhancement

2020 ◽  
pp. 002072092094061
Author(s):  
Chunbo Ma ◽  
Jun Ao
Keyword(s):  
Image Processing ◽  
Image Enhancement ◽  
Stochastic Resonance ◽  
Image Sequence ◽  
Two Dimensional ◽  
Original Image ◽  
Resonance System ◽  
One Dimensional ◽  
Wiener Filters ◽  
The One

How to extract useful information from noised image is always an important issue for image processing. Many methods have been proposed in image enhancement field. However, in these methods the noise is usually considered as harmful and should be removed as much as possible. Stochastic resonance is a very different method, in which the noise is regarded as a driver to push the stochastic resonance system to output enhanced image. In this paper, the cumulative gain is introduced and the sequence average is used to enhance the original image information which hidden in a noised image sequence produced by bistable stochastic resonance. We present the one-dimensional and two-dimensional stochastic resonance methods and discuss their performance in this paper. Experiments illustrate that the one-dimensional average stochastic resonance has the best performance considering the indicator PSNR and SSIM. Compared with traditional filters such as median and Wiener filters, the proposed methods have significant advantages.

Regions-based Two-dimensional Continua: The Euclidean Case

2018 ◽  
Author(s):  
Geoffrey Hellman ◽  
Stewart Shapiro
Keyword(s):  
Mathematical Induction ◽  
Dimensional Case ◽  
Two Dimensional ◽  
Entire Space ◽  
Euclidean Case ◽  
Free Basis ◽  
One Dimensional ◽  
Archimedean Property ◽  
The One

This chapter develops a Euclidean, two-dimensional, regions-based theory. As with the semi-Aristotelian account in Chapter 2, the goal here is to recover the now orthodox Dedekind–Cantor continuum on a point-free basis. The chapter derives the Archimedean property for a class of readily postulated orientations of certain special regions, what are called “generalized quadrilaterals” (intended as parallelograms), by which the entire space is covered. Then the chapter generalizes this to arbitrary orientations, and then establishes an isomorphism between the space and the usual point-based one. As in the one-dimensional case, this is done on the basis of axioms which contain no explicit “extremal clause”, and we have no axiom of induction other than ordinary numerical (mathematical) induction.

MUTUAL EXCLUSION ON OPTICAL BUSES

2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA
Keyword(s):  
Mutual Exclusion ◽  
Two Dimensional ◽  
One Dimensional ◽  
Dimensional Array ◽  
Propagation Delays ◽  
Optical Buses ◽  
The One

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.

scholarly journals DIFFERENTIAL EQUATION APPROACH FOR ONE- AND TWO-DIMENSIONAL LATTICE GREEN'S FUNCTION

2007 ◽  
Vol 21 (02n03) ◽  
pp. 139-154 ◽  
Author(s):  
J. H. ASAD
Keyword(s):  
Differential Equation ◽  
Green’S Function ◽  
Recurrence Relation ◽  
Green's Function ◽  
Two Dimensional ◽  
Dimensional Lattice ◽  
One Dimensional ◽  
The One ◽  
Lattice Green's Function ◽  
Lattice Green’S Function

A first-order differential equation of Green's function, at the origin G(0), for the one-dimensional lattice is derived by simple recurrence relation. Green's function at site (m) is then calculated in terms of G(0). A simple recurrence relation connecting the lattice Green's function at the site (m, n) and the first derivative of the lattice Green's function at the site (m ± 1, n) is presented for the two-dimensional lattice, a differential equation of second order in G(0, 0) is obtained. By making use of the latter recurrence relation, lattice Green's function at an arbitrary site is obtained in closed form. Finally, the phase shift and scattering cross-section are evaluated analytically and numerically for one- and two-impurities.

Substrate induced freezing, melting and depinning transitions in two-dimensional liquid crystalline systems

2022 ◽  
Author(s):  
Bharti bharti ◽  
Debabrata Deb
Keyword(s):  
Molecular Dynamics ◽  
Liquid Crystals ◽  
Molecular Dynamics Simulations ◽  
Liquid Crystalline ◽  
Two Dimensional ◽  
One Dimensional ◽  
The One ◽  
Dynamics Simulations

We use molecular dynamics simulations to investigate the ordering phenomena in two-dimensional (2D) liquid crystals over the one-dimensional periodic substrate (1DPS). We have used Gay-Berne (GB) potential to model the...

scholarly journals Water storage in wetted strips under irrigated coffee trees with different criteria of irrigation management

2013 ◽  
Vol 33 (2) ◽  
pp. 249-257 ◽  
Author(s):  
Alberto Colombo ◽  
Lívia A. Alvarenga ◽  
Myriane S. Scalco ◽  
Randal C. Ribeiro ◽  
Giselle F. Abreu
Keyword(s):  
Dimensional Analysis ◽  
Drip Irrigation ◽  
Irrigation Management ◽  
Water Storage ◽  
Moisture Distribution ◽  
Water Volume ◽  
Two Dimensional ◽  
One Dimensional ◽  
Irrigation Interval ◽  
The One

The increasing demand for water resources accentuates the need to reduce water waste through a more appropriate irrigation management. In the particular case of irrigated coffee planting, which in recent years presented growth with the predominance of drip irrigation, the improvement of drip irrigation management techniques is a necessity. The proper management of drip irrigation depends on the knowledge of the spatial pattern of soil moisture distribution inside the wetted strip formed under the irrigation lines. In this study, grids of 24 tensiometers were used to determine the water storage within the wetted strip formed under drippers, with a 3.78 L h-1 discharge, evenly spaced by 0.4 m, subjected to two different management criteria (fixed irrigation interval and 60 kPa tension). Estimates of storage based on a one-dimensional analysis, that only considers depth variations, were compared with two-dimensional estimates. The results indicate that for high-frequency irrigation the one-dimensional analysis is not appropriate. However, under less frequent irrigation, the two-dimensional analysis is dispensable, being the one-dimensional sufficient for calculating the water volume stored in the wetted strip.

Computationally Efficient Model for 2D Ion Implantation Simulation

1997 ◽  
Vol 490 ◽  
Author(s):  
Misha Temkin ◽  
Ivan Chakarov
Keyword(s):  
Ion Implantation ◽  
Efficient Method ◽  
Two Dimensional ◽  
Computationally Efficient ◽  
Crystalline Materials ◽  
One Dimensional ◽  
The One

ABSTRACTA computationally efficient method for ion implantation simulation is presented. The method allows two-dimensional ion implantation profiles in arbitrary shaped structures to be calculated and is valid for both amorphous and crystalline materials. It uses an extension of the one-dimensional dual Pearson approximation into the second dimension.

Preparation of Bio Tissue Micro Array Based on NC Positioning and Image Processing Technology

2011 ◽  
Vol 299-300 ◽  
pp. 1128-1131
Author(s):  
Yu Cheng Zhang
Keyword(s):  
Image Processing ◽  
Processing System ◽  
Poor Quality ◽  
Processing Technology ◽  
Tissue Micro Array ◽  
Image Identification ◽  
Micro Hole ◽  
Micro Array ◽  
Accurate Position ◽  
The One

Against the problem on poor quality and inefficiency in the preparation of bio tissue micro array by hand, the one processing system of biotissue micro-array was developed. The application of NC image identification technology was made to carry out auto punching, auto-positioning- embedding, and auto-extracting, etc. The auto preparation of biotissue micro array was completed. The adoption of the minimum squares fitting was aimed at object’s primes to be fitted so as to obtain special-feature parameters to finish accurate position and auto rectification of deviation visual view range in micro-hole image. There by, visual deviation operated by hand was avoided and highlighted the processed accuracy.

Sign in / Sign up

Export Citation Format

Share Document