scholarly journals Metode Pusat dan Circular Hough Transformation untuk Mendeteksi Lingkaran pada Sebuah Citra

2020 ◽  
Vol 11 (2) ◽  
pp. 301-310
Author(s):  
Zaiful Bahri
Keyword(s):  
Light Intensity ◽  
Object Detection ◽  
Two Dimensional ◽  
Hough Transformation ◽  
Sequential Memory ◽  
Parameter Values

Tulisan ini membahas tentang penerapan metode pusat dan Circular Hough Transformation(CHT) untuk mendeteksi semua lingkaran yang terkandung dalam citra baik lingkaran tunggal maupun lingkaran yang tumpang tindih. Metode pusat dan CHT memainkan peran penting dalam mendeteksi lingkaran yang terkandung dalam citra melalui array akumulator dua dimensi A(a, b) yang memiliki memori berurutan dengan titik pusat dari lingkaran yang tumpang tindih sehingga dapat dihitung untuk setiap titik pada kurva menggunakan nilai parameter jari-jari yang dipilih untuk mendapatkan nilai triplet (a, b, r) pada Circular Hough Transformation (CHT). Metode pusat merupakan alternatif lain untuk mendetekasi lingkaran dalam sebuah citra, melalui pre-processing seperti, input citra, deteksi objek, ambang batas tepi, skala abu-abu. Kemudian digunakan metode pusat untuk CHT. Akhirnya adalah mengimplementasikan metode pusat dan Cricular Hough Transformation menggunakan Matlab R2020b. Dengan sisitem yang dibangun dapat dideteksi seluruh lingkaran yang terdapat pada citra dengan akurasi 100% dengan memberikan intensitas cahaya 0.93 dan ambang batas 0.33 dan polarisasi objek gelap dan terang serta rentang jari-jaroi antara 16px dan 110px. Tentunya ini tidak berlaku untuk citra yang memuat lingkaran dengan jari-jari yang lebih dari 110px atau kurang dari 16px.   Kata kunci: Metode Pusat, Lingkaran, Jari-Jari, Citra, CHT   Abstract This paper discusses the application of the center method and Circular Hough Transformation (CHT) to detect all circles contained in an image, both single circles and overlapping circles. The center and CHT methods play an important role in detecting the circle contained in the image via a two-dimensional accumulator array A (a, b) which has sequential memory with the center points of the overlapping circles so that it can be calculated for each point on the curve using parameter values. the radius selected to obtain the triplet values (a, b, r) of the Circular Hough Transformation (CHT). The center method is another alternative for detecting circles in an image, through pre-processing such as image input, object detection, edge threshold, grayscale. Then the central method for CHT was used. Finally is to implement the central method and the Cricular Hough Transformation using the Matlab R2020b. With the built system it can be detected all the circles in the image with 100% accuracy by providing a light intensity of 0.93 and a threshold of 0.33 and polarization of dark and light objects and a radius range between 16px and 110px. Of course this does not apply to images that contain circles with radii greater than 110px or less than 16px.   Keywords: Center Method, Circle, Radii, Image, CHT.

scholarly journals Selection of Pairings Reaching Evenly Across the Data (SPREAD): A simple algorithm to design maximally informative fully crossed mating experiments

2014 ◽  
Author(s):  
Kolea Zimmerman ◽  
Daniel Levitis ◽  
Ethan Addicott ◽  
Anne Pringle
Keyword(s):  
Nearest Neighbor ◽  
Simple Algorithm ◽  
Two Dimensional ◽  
Neighbor Distance ◽  
Crossing Experiments ◽  
The Mean ◽  
Parameter Values ◽  
Selection Of ◽  
Novel Algorithm ◽  
Trait Space

We present a novel algorithm for the design of crossing experiments. The algorithm identifies a set of individuals (a ?crossing-set?) from a larger pool of potential crossing-sets by maximizing the diversity of traits of interest, for example, maximizing the range of genetic and geographic distances between individuals included in the crossing-set. To calculate diversity, we use the mean nearest neighbor distance of crosses plotted in trait space. We implement our algorithm on a real dataset ofNeurospora crassastrains, using the genetic and geographic distances between potential crosses as a two-dimensional trait space. In simulated mating experiments, crossing-sets selected by our algorithm provide better estimates of underlying parameter values than randomly chosen crossing-sets.

scholarly journals Feasibility Study of Textureless Object Detection and Pose Estimation Based on a Model with 3D Edgels and Surfaces

2015 ◽  
Vol 6 (1) ◽  
Author(s):  
Kimitoshi Yamazaki ◽  
Kiyohiro Sogen ◽  
Takashi Yamamoto ◽  
Masayuki Inaba
Keyword(s):  
Object Detection ◽  
Feasibility Study ◽  
Pose Estimation ◽  
Template Matching ◽  
Input Data ◽  
Three Dimensional ◽  
Target Object ◽  
Textural Features ◽  
Two Dimensional ◽  
Home Appliances

Abstract This paper describes a method for the detection of textureless objects. Our target objects include furniture and home appliances, which have no rich textural features or characteristic shapes. Focusing on the ease of application, we define a model that represents objects in terms of three-dimensional edgels and surfaces. Object detection is performed by superimposing input data on the model. A two-stage algorithm is applied to bring out object poses. Surfaces are used to extract candidates fromthe input data, and edgels are then used to identify the pose of a target object using two-dimensional template matching. Experiments using four real furniture and home appliances were performed to show the feasibility of the proposed method.We suggest the possible applicability in occlusion and clutter conditions.

scholarly journals Dispersal Distances for Airborne Spores Based on Deposition Rates and Stochastic Modeling

2007 ◽  
Vol 97 (10) ◽  
pp. 1325-1330 ◽  
Author(s):  
Anders Stockmarr ◽  
Viggo Andreasen ◽  
Hanne Østergård
Keyword(s):  
Fungal Spores ◽  
Two Dimensional ◽  
Airborne Spores ◽  
Modeling Framework ◽  
Deposition Rates ◽  
Spore Release ◽  
Special Cases ◽  
Release Height ◽  
Dispersal Distances ◽  
Parameter Values

A new modeling framework for particle dispersal is explored in the context of the particles being fungal spores dispersed within a field. The model gives rise to both exponentially decreasing and polynomially decreasing two-dimensional densities of deposited fungal spores. We reformulate the model in terms of time to deposition, and show how this concept is equivalent to the deposition rate for fungal spores. Special cases where parameter values for wind and gravitation lead to exponentially or polynomially decreasing densities are discussed, and formulas for one- and two-dimensional densities of deposited spores are given explicitly in terms of parameters for diffusion, wind, gravitation, and spore release height.

scholarly journals Interpolator: a two-dimensional graphical interpolation system for the simultaneous control of digital signal processing parameters

2001 ◽  
Vol 6 (2) ◽  
pp. 147-151 ◽  
Author(s):  
Martin Spain ◽  
Richard Polfreman
Keyword(s):  
Signal Processing ◽  
Digital Signal Processing ◽  
Digital Signal ◽  
Processing Parameters ◽  
Digital Audio ◽  
Two Dimensional ◽  
Current Position ◽  
Control Space ◽  
Simultaneous Control ◽  
Parameter Values

The musical use of realtime digital audio tools implies the need for simultaneous control of a large number of parameters to achieve the desired sonic results. Often it is also necessary to be able to navigate between certain parameter configurations in an easy and intuitive way, rather than to precisely define the evolution of the values for each parameter. Graphical interpolation systems (GIS) provide this level of control by allocating objects within a visual control space to sets of parameters that are to be controlled, and using a moving cursor to change the parameter values according to its current position within the control space. This paper describes Interpolator, a two-dimensional interpolation system for controlling digital signal processing (DSP) parameters in real time.

SHAPE RECOGNITION BY HUMAN-LIKE TRIAL AND ERROR RANDOM PROCESSES

1996 ◽  
Vol 10 (05) ◽  
pp. 473-490 ◽  
Author(s):  
MAKOTO NAGAO
Keyword(s):  
Object Detection ◽  
Feature Detection ◽  
Structural Description ◽  
Two Dimensional ◽  
Trial And Error ◽  
Large Area ◽  
Variable Size ◽  
Mutual Correlation ◽  
Object Parts ◽  
Characteristic Features

Pattern recognition and object detection systems so far developed required the algorithmic description of every detail of the objects to be recognized by bottom-up process from pixel-to-pixel relation to line, corner, and structural description. Because this low-level process does not see global information, feature detection is highly sensitive to noise. To overcome this problem and to give human-like flexibility to machine recognition process, we developed a new system which had non-algorithmic feature detection functions by seeing a comparatively large area at once. It uses a variable size window which is applied to the most plausible parts in an image by a top-down command from an object model, and obtains characteristic features of object parts. This window application is realized mostly in hardware, and has some autonomic ability to detect the best features by a sort of random trial and error search. The system has some other hardware functions such as mutual correlation of one- and two-dimensional patterns, which are also flexible according to the variable size window. The system interprets user's declarative description of objects, and activates the window application functions to obtain characteristic features of the description. This new flexible approach of object detection can be used as a robot eye to recognize many simple two-dimensional shapes.

scholarly journals Asymptotic (statistical) periodicity in two-dimensional maps

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Fumihiko Nakamura ◽  
Michael C. Mackey
Keyword(s):  
Dynamical System ◽  
Bounded Variation ◽  
High Dimensional ◽  
Sufficient Condition ◽  
Two Dimensional ◽  
Function Of Bounded Variation ◽  
Dimensional Dynamical System ◽  
Asymptotic Periodicity ◽  
Parameter Values

<p style='text-indent:20px;'>In this paper we give a new sufficient condition for the existence of asymptotic periodicity of Frobenius–Perron operators corresponding to two–dimensional maps. Asymptotic periodicity for strictly expanding systems, that is, all eigenvalues of the system are greater than one, in a high-dimensional dynamical system was already known. Our new result enables one to deal with systems having an eigenvalue smaller than one. The key idea for the proof is to use a function of bounded variation defined by line integration. Finally, we introduce a new two-dimensional dynamical system numerically exhibiting asymptotic periodicity with different periods depending on parameter values, and discuss the application of our theorem to the example.</p>

scholarly journals Asymptotic Limit-cycle Analysis of Oscillating Chemical Reactions

2021 ◽  
Author(s):  
Alain Brizard ◽  
Samuel Berry
Keyword(s):  
Limit Cycle ◽  
Chemical Reactions ◽  
Relaxation Oscillation ◽  
Three Dimensional ◽  
Van Der Pol Oscillator ◽  
Asymptotic Limit ◽  
Two Dimensional ◽  
Van Der Pol ◽  
Parameter Values ◽  
Analytical Expressions

Abstract The asymptotic limit-cycle analysis of mathematical models for oscillating chemical reactions is presented. In this work, after a brief presentation of mathematical preliminaries applied to the biased Van der Pol oscillator, we consider a two-dimensional model of the Chlorine dioxide Iodine Malonic-Acid (CIMA) reactions and the three-dimensional and two-dimensional Oregonator models of the Belousov-Zhabotinsky (BZ) reactions. Explicit analytical expressions are given for the relaxation-oscillation periods of these chemical reactions that are accurate within 5% of their numerical values. In the two-dimensional CIMA and Oregonator models, we also derive critical parameter values leading to canard explosions and implosions in their associated limit cycles.

Periodic travelling interfacial hydroelastic waves with or without mass II: Multiple bifurcations and ripples

2018 ◽  
Vol 30 (04) ◽  
pp. 756-790 ◽  
Author(s):  
BENJAMIN F. AKERS ◽  
DAVID M. AMBROSE ◽  
DAVID W. SULON
Keyword(s):  
Travelling Waves ◽  
Global Bifurcation ◽  
Travelling Wave ◽  
Two Dimensional ◽  
Wave Problem ◽  
Bifurcation Theorem ◽  
One Dimensional ◽  
Spatially Periodic ◽  
Parameter Values ◽  
The Waves

In a prior work, the authors proved a global bifurcation theorem for spatially periodic interfacial hydroelastic travelling waves on infinite depth, and computed such travelling waves. The formulation of the travelling wave problem used both analytically and numerically allows for waves with multi-valued height. The global bifurcation theorem required a one-dimensional kernel in the linearization of the relevant mapping, but for some parameter values, the kernel is instead two-dimensional. In the present work, we study these cases with two-dimensional kernels, which occur in resonant and non-resonant variants. We apply an implicit function theorem argument to prove existence of travelling waves in both of these situations. We compute the waves numerically as well, in both the resonant and non-resonant cases.

scholarly journals Larger than Life: Digital Creatures in a Family of Two-Dimensional Cellular Automata

2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Kellie M. Evans
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Nearest Neighbor ◽  
Two Dimensional ◽  
Game Of Life ◽  
Large Neighborhood ◽  
International Audience ◽  
Parameter Values

International audience We introduce the Larger than Life family of two-dimensional two-state cellular automata that generalize certain nearest neighbor outer totalistic cellular automaton rules to large neighborhoods. We describe linear and quadratic rescalings of John Conway's celebrated Game of Life to these large neighborhood cellular automaton rules and present corresponding generalizations of Life's famous gliders and spaceships. We show that, as is becoming well known for nearest neighbor cellular automaton rules, these ``digital creatures'' are ubiquitous for certain parameter values.

Sign in / Sign up

Export Citation Format

Share Document