Journal articles on the topic 'Edge'
To see the other types of publications on this topic, follow the link: Edge.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Edge.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Young, Hilary C., Tyler G. Reid, Lea A. Randall, Leanna E. Lachowsky, Danusha J. Foster, Chris J. Pengelly, Tanya Latty, and Mary L. Reid. "Influences of Movement Behavior on Animal Distributions at Edges of Homogeneous Patches." International Journal of Zoology 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/602845.
Full textAbstract:
We propose that changes in movement behavior may be a proximate mechanism that influences the accumulation of animals at habitat edges. We tested this idea with a combination of empirical and simulation experiments in a resource-free landscape. The movements of individual flour beetles,Tribolium confusum, were tracked across a paper arena edged with invisible tape until beetles crossed the edge. Movement behavior (step lengths and turn angles) and cumulative occupancy were analyzed according to distance from the edge. We found that beetles took smaller steps with larger turn angles near edges than in the center of the arena and that beetle distribution was highly biased towards the edge of the arena. We then tested two agent-based simulation models for each beetle: an edge-independent model and an edge-dependent model. Both models predicted less time spent at the edge than was observed. The proportion of time spent at edges depended on the propensity to cross the edge, which could not be explained by beetle body size or energetic condition. The distribution of animals with respect to habitat edges depends on many factors, but we suggest that proximate mechanisms such as movement behavior should be explicitly considered when interpreting animal distributions.
2
Bošković, Željko. "Getting Really Edgy: On the Edge of the Edge." Linguistic Inquiry 47, no. 1 (January 2016): 1–33. http://dx.doi.org/10.1162/ling_a_00203.
Full textAbstract:
The article argues that in constructions where there is more than one phrase at a phasal edge, only the highest edge is available for movement and anaphor binding. This shows that only the outermost edge counts as the edge of a phase for the Phase Impenetrability Condition ( PIC). The article also demonstrates that moving the element that counts as the phasal edge in multiple specifier/adjunct cases can affect the PIC status of the remaining edges. These conclusions provide a new argument for the contextuality of phasehood. A number of recent works have argued that the phasal status of a phrase can be affected by the syntactic context in which it occurs. This article goes one step further: it shows that the concept of phasal edge, more precisely the status of a specifier/adjunct regarding the PIC, can also be affected by the syntactic context in which the specifier/adjunct occurs. The article also discusses several issues regarding the syntax and semantics of adjectives, possessors, and demonstratives, including what Partee (2006) calls familiar demonstratives, as well as anaphor binding.
3
Konishi, Akihito, Yasukazu Hirao, Hiroyuki Kurata, Takashi Kubo, Masayoshi Nakano, and Kenji Kamada. "Anthenes: Model systems for understanding the edge state of graphene nanoribbons." Pure and Applied Chemistry 86, no. 4 (April 17, 2014): 497–505. http://dx.doi.org/10.1515/pac-2013-0811.
Full textAbstract:
AbstractThe edge state, which is a peculiar magnetic state in zigzag-edged graphene nanoribbons (ZGNRs) originating from an electron–electron correlation in an edge-localized π-state, has promising applications for magnetic and spintronics devices and has attracted much attention of physicists, chemists, and engineers. For deeper understanding of the edge state, precise fabrication of edge structures in ZGNRs has been highly demanded. We focus on anthenes, which are peri-condensed anthracenes that have zigzag and armchair edges on the molecular periphery, as model systems for understanding, and indeed prepare and characterize them. This paper summarizes our recent studies on the origin of the edge state by investigating anthenes in terms of the relationship between the molecular structure and spin-localizing character.
4
강은경. "Symmetries of edges in phonology: EDGE-HIGHLIGHT and EDGE-AVOIDANCE." Studies in Phonetics, Phonology, and Morphology 14, no. 3 (December 2008): 329–53. http://dx.doi.org/10.17959/sppm.2008.14.3.329.
Full text
5
Breś, Justyna, and Karolina A. Krośnicka. "Evolution of Edges and Porosity of Urban Blue Spaces: A Case Study of Gdańsk." Urban Planning 6, no. 3 (July 27, 2021): 90–104. http://dx.doi.org/10.17645/up.v6i3.4108.
Full textAbstract:
Current waterfront studies focus mainly on a land-based perspective, failing to include the water side. Water is, however, not just a resource for port and industrial purposes and an edge to the waterfront; it is also a feature of the waterfront and the complex relation between water and city. Thus, the article suggests that water-land edges need to be re-contextualised, taking into consideration also their shape, functionality, and evolution over time. This article therefore introduces the concept of urban blue spaces, that is, spaces that include at least one land-water edge, such as a shoreline or river edge. The types and character of these edges define the porosity of urban blue spaces: Spaces with easy connections, such as boulevards or parks, are highly porous, while fenced areas have low porosity. The research first analyses the existing literature on the spatial and functional characteristics of the land-water edge in port cities, and explores existing typologies of urban blue spaces. The results of this investigation are used to examine the most iconic urban blue space of Gdańsk, the Motława river, over the last 1000 years. The case study shows that the porosity of the Gdańsk urban blue space has been increasing over time, in line with its spatial and functional development from an undeveloped riverbank to a ‘gated’ port and industry area, to urban living spaces today. The article thus presents the whole breadth of urban blue spaces through the case study of the Motława river urban blue space. The spatial evolution of the urban blue space is depicted through the transformation of its land-water edge—from a natural sloping edge to the dominance of vertical edged structures or ones overhanging the surface of the water, to the emergence of spatially ‘blurred’ sloping, slanted, terraced, and floating structures, partially independent of the riverbank. The transformation of the structure of the Motława urban blue space edges increased its complexity over time, from a single-edge structure to a double and multiple-edged one.
6
Mapurisa, W., and G. Sithole. "IMPROVED EDGE DETECTION FOR SATELLITE IMAGES." ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences V-2-2022 (May 17, 2022): 185–92. http://dx.doi.org/10.5194/isprs-annals-v-2-2022-185-2022.
Full textAbstract:
Abstract. Edges are a key feature employed in various computer vision applications namely segmentation, object recognition, feature tracking and 3D reconstruction. Edges provide key information with regards to object presence, shape, form and detail which aid in many computer vision tasks. While there are various edge detection techniques in literature, challenges in edge detection remain. Varying image contrast due to non uniform scene illumination and imaging resolution affects the edge information obtained from any given image. The edge detection results are characterised by missing edges, edge fragmentation and some false positive edges. Gradient based edge detectors are the most commonly used detectors. These detectors all suffer from aforementioned challenges. In this, paper we present an edge detection framework that aims to recover long unfragmented edges from satellite images. This is achieved by using an edge accumulator that operates on the entire edge detection parameter space. Gradient based edge detectors rely on thresholding to retrieve salient edges. This usually results in missed or noisy edges. To counter this, the accumulator is run over a wide parameter space, growing edges at each accumulator level while maintaining edge position using a localisation filter. The results are longer unbroken edges that are detected for most objects, even in shadowy regions and low contrast areas. The results show improved edge detection that preserves the form and detail of objects when compared to current gradient based detectors.
7
Nalwa, Vishvjit S., and Eric Pauchon. "Edgel aggregation and edge description." Computer Vision, Graphics, and Image Processing 38, no. 2 (May 1987): 228. http://dx.doi.org/10.1016/s0734-189x(87)80142-1.
Full text
8
Nalwa, Vishvjit S., and Eric Pauchon. "Edgel aggregation and edge description." Computer Vision, Graphics, and Image Processing 40, no. 1 (October 1987): 79–94. http://dx.doi.org/10.1016/0734-189x(87)90057-0.
Full text
9
Janani R. "On Edge Prime Index of a Graph." Communications on Applied Nonlinear Analysis 31, no. 2 (May 17, 2024): 42–54. http://dx.doi.org/10.52783/cana.v31.512.
Full textAbstract:
Relatively Prime Edge labeling extends the notion of prime labeling by considering edges. Prime labeling requires adjacent vertices to possess relatively prime labels, while relatively prime edge labeling requires adjacent edges to have relatively prime labels. The transformation of a coprime edge-labeled graph into a relatively prime edge-labeled graph introduces the concept of Edge Prime Index (or Relatively Prime Index). This study focuses on cases where a coprime edge-labeled graph can be converted into a relatively prime edge-labeled graph by removing certain edges from graph G, thereby establishing the concept of Edge Prime Index. Finally, the Edge Prime Index of some graphs are found.
10
Werner, Liliana, and Manfred Tetz. "Edge Profiles of Currently Available Intraocular Lenses and Recent Improvements." European Ophthalmic Review 03, no. 02 (2009): 74. http://dx.doi.org/10.17925/eor.2009.03.02.74.
Full textAbstract:
We evaluated the microstructure of the edges of currently available foldable intraocular lenses (IOLs). The methodology used assisted an IOL manufacturer (Hoya, Japan) to optimise the edge profile of its lenses. Ten designs of hydrophobic acrylic, six designs of silicone and 24 designs of hydrophilic acrylic IOLs were imaged under scanning electron microscopy (SEM), and the photographs were imported to a digital computer program. The area above the posterior–lateral edge, representing the deviation from a perfect square, was measured in square microns. There was a large variation of the area values measured in currently available foldable IOLs labelled as square-edged lenses. As a group, the edges of hydrophilic acrylic lenses were less square than those of hydrophobic acrylic and silicone lenses. Hydrophobic acrylic AF-1 Hoya lenses had a high area value (329.7μ2). Through manufacturing changes, the edges of the lenses were then optimised to a value down to 39.1μ2, which represents the most square hydrophobic acrylic edge currently available.
11
Raj, P. Markondeya, Stanley M. Dunn, and W. Roger Cannon. "Edge Sharpening for Unbiased Edge Detection in Field Emission Scanning Electron Microscope Images." Microscopy and Microanalysis 5, no. 2 (March 1999): 136–46. http://dx.doi.org/10.1017/s1431927699000100.
Full textAbstract:
We report here a specific type of edge strength anisotropy observed in field emission scanning electron microscope (FESEM) images. The images show weaker edge gradients in the scanning direction and hence these edges frequently go undetected. Direct application of edge detection algorithms to images with nondistinct edges, such as powder particles, show strong bias to edges perpendicular to the scanning direction. Edge orientation polarograms obtained from these images always show strong fictitious particle orientation in the scanning direction. In this work, we discuss an edge-sharpening algorithm that corrects for this bias and results in relatively more accurate and consistent edge orientation information.
12
Norris, D. Ryan, Bridget J. M. Stutchbury, and Trevor E. Pitcher. "The Spatial Response of Male Hooded Warblers to Edges in Isolated Fragments." Condor 102, no. 3 (August 1, 2000): 595–600. http://dx.doi.org/10.1093/condor/102.3.595.
Full textAbstract:
Abstract We tested whether Hooded Warblers (Wilsonia citrina) avoided abrupt forest edges by radiotracking males breeding in small, isolated forest patches (0.5–2.0 ha) in northwest Pennsylvania. Because territory edges were synonymous with abrupt forest edges in all cases, we compared space use patterns with males radiotracked in a nearby continuous forest (150 ha), where we defined edge from territorial boundaries. Based on the proportion of edge to core area, males in both habitats avoided the area within 20 m of the edge, implying that males responded to the presence of territory edge rather than forest edge. Surprisingly, however, males in isolated fragments used the edge area significantly more than males in continuous forest, even when measured against the relative amount of edge area within each territory. Elevated levels of edge use were not related to distance of nests to edges, nest stage, or time of day. We conclude that the presence of physical edges is not the sole determinant of territorial space use in this species and there are likely additional social factors influencing occupancy rates in small, isolated woodlots. Therefore, definitions of forest-interior species based on edge use need to be reconsidered.
13
KRANAKIS, EVANGELOS, DANNY KRIZANC, OSCAR MORALES PONCE, and LADISLAV STACHO. "BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS." Discrete Mathematics, Algorithms and Applications 04, no. 03 (August 6, 2012): 1250036. http://dx.doi.org/10.1142/s179383091250036x.
Full textAbstract:
2-Edge connectivity is an important fault tolerance property of a network because it maintains network communication despite the deletion of a single arbitrary edge. Planar spanning subgraphs have been shown to play a significant role for achieving local decentralized routing in wireless networks. Existing algorithmic constructions of spanning planar subgraphs of unit disk graphs (UDGs) such as Minimum Spanning Tree, Gabriel Graph, Nearest Neighborhood Graph, etc. do not always ensure connectivity of the resulting graph under single edge deletion. Furthermore, adding edges to the network so as to improve its edge connectivity not only may create edge crossings (at points which are not vertices) but it may also require edges of unbounded length. Thus we are faced with the problem of constructing 2-edge connected geometric planar spanning graphs by adding edges of bounded length without creating edge crossings (at points which are not vertices). To overcome this difficulty, in this paper we address the problem of augmenting the edge set (i.e., adding new edges) of planar geometric graphs with straight line edges of bounded length so that the resulting graph is planar and 2-edge connected. We provide bounds on the number of newly added straight-line edges, prove that such edges can be of length at most 3 times the max length of an edge of the original graph, and also show that the factor 3 is optimal. It is shown to be NP-Complete to augment a geometric planar graph to a 2-edge connected geometric planar graph with the minimum number of new edges of a given bounded length. We also provide a constant time algorithm that works in location-aware settings to augment a planar graph into a 2-edge connected planar graph with straight-line edges of length bounded by 3 times the longest edge of the original graph. It turns out that knowledge of vertex coordinates is crucial to our construction and in fact we prove that this problem cannot be solved locally if the vertices do not know their coordinates. Moreover, we provide a family of k-connected UDGs which does not have 2-edge connected spanning planar subgraphs, for any [Formula: see text].
14
He, Dong Jian, Rui Shu Liu, and Huai Bo Song. "Closed Salient Edge Extraction Based on Visual Attention Mechanism." Applied Mechanics and Materials 58-60 (June 2011): 1972–78. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1972.
Full textAbstract:
Edge detection is a means of generating compact descriptions which preserve most of the structural information in an image. However, the edge image returned by the edge operators usually contains false edge points or exhibits gaps in edges which are generated by image noise. To solve the problem, a closed salient edge extraction approach was proposed, which makes use of the visual attention model given out by Itti together with the original edge image to obtain the salient edges and then the salient-edge gaps were linked so that the closed salient edge of an image can be extracted. In order to link the edges, a membership function based on the gradient and directions of endpoints of the salient edge image was carried out to control the extension of endpoints. Experimental results showed that the proposed algorithm was able to extract the closed salient edge of an image effectively especially for the image whose background was not very complex.
15
Dobrescu, Oana-Ancuta, and M. Apostol. "Tight-binding approximation for bulk and edge electronic states in graphene." Canadian Journal of Physics 93, no. 5 (May 2015): 580–84. http://dx.doi.org/10.1139/cjp-2014-0313.
Full textAbstract:
The tight-binding approximation is employed here to investigate electronic bulk and edge (“surface”) states in semi-infinite graphene sheets and graphene monolayer ribbons with various edge terminations (zigzag, horseshoe, and armchair edges). It is shown that edge states do not exist for a uniform hopping (transfer) matrix. The problem is generalized to include edge elements of the hopping matrix distinct from the infinite-sheet (“bulk”) ones. In this case, semi-infinite graphene sheets with zigzag or horseshoe edges exhibit edge states, while semi-infinite graphene sheets with armchair edges do not. The energy of the edge states lies above the (zero) Fermi level. Similarly, symmetric graphene ribbons with zigzag or horseshoe edges exhibit edge states, while ribbons with asymmetric edges (zigzag and horseshoe) do not. It is also shown how to construct the “reflected” solutions (bulk states) for the intervening equations with finite differences both for semi-infinite sheets and ribbons.
16
Wang, Yanling, and Shiying Wang. "Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs." AIMS Mathematics 6, no. 12 (2021): 13210–21. http://dx.doi.org/10.3934/math.2021763.
Full textAbstract:
<abstract><p>This paper studies the edge-fault-tolerant strong Menger edge connectivity of $ n $-dimensional bubble-sort graph $ B_{n} $. We give the values of faulty edges that $ B_{n} $ can tolerant when $ B_{n} $ is strongly Menger edge connected under two conditions. When there are $ (n-3) $ faulty edges removed from $ B_{n} $, the $ B_{n} $ network is still working and it is strongly Menger edge connected. When the condition of any vertex in $ B_{n} $ has at least two neighbors is imposed, the number of faulty edges that can removed from $ B_{n} $ is $ (2n-6) $ when $ B_{n} $ is also strongly Menger edge connected. And two special cases are used to illustrate the correctness of the conclusions. The conclusions can help improve the reliability of the interconnection networks.</p></abstract>
17
Meng, Belinda Chong Chiew, Dayang Suhaida Awang Damit, and Nor Salwa Damanhuri. "Comparative studies of multiscale edge detection using different edge detectors for MRI thigh." Bulletin of Electrical Engineering and Informatics 10, no. 4 (August 1, 2021): 1979–86. http://dx.doi.org/10.11591/eei.v10i4.2220.
Full textAbstract:
Edge detection plays an important role in computer vision to extract object boundary. Multiscale edge detection method provides a variety of image features by different resolution at multiscale of edges. The method extracts coarse and fine structure edges simultaneously in an image. Due to this, the multiscale method enables more reliable edges are detected. Most of the multiscale methods are not translation invariant due to the decimated process. They mostly depend on the corresponding transform coefficients. These methods need more computation and a larger storage space. This study proposes a multiscale method that uses an average filter to smooth image at three different scales. Three different classical edge detectors namely Prewitt, Sobel and Laplacian were used to extract the edges from the smooth images. The edges extracted from the different scales of smooth images were then combined to form the multiscale edge detection. The performances of the multiscale images extracted from the three classical edge detectors were then compared and discussed.
18
Zhang, Heng Lei, Dhananjay Ravat, Yára R. Marangoni, and Xiang Yun Hu. "NAV-Edge: Edge detection of potential-field sources using normalized anisotropy variance." GEOPHYSICS 79, no. 3 (May 1, 2014): J43—J53. http://dx.doi.org/10.1190/geo2013-0218.1.
Full textAbstract:
Most existing edge-detection algorithms are based on the derivatives of potential-field data, and thus, enhance high wavenumber information and are sensitive to noise. The normalized anisotropy variance method (NAV-Edge) was proposed for detecting edges of potential-field anomaly sources based on the idea of normalized standard deviation (NSTD). The main improvement over the balanced, windowed normalized variance method (i.e., NSTD) used for similar purposes was the application of an anisotropic Gaussian function designed to detect directional edges and reduce sensitivity to noise. NAV-Edge did not directly use higher-order derivatives and was less sensitive to noise than the traditional methods that use derivatives in their calculation. The utility of NAV-Edge was demonstrated using synthetic potential-field data and real magnetic data. Compared with several existing methods (i.e., the curvature of horizontal gradient amplitude, tilt angle and its total-horizontal derivative, theta map, and NSTD), NAV-Edge produced superior results by locating edges closer to the true edges, resulting in better interpretive images.
19
Kamaraj, T., and J. Thangakani. "Edge even and edge odd graceful labelings of Paley Graphs." Journal of Physics: Conference Series 1770, no. 1 (March 1, 2021): 012068. http://dx.doi.org/10.1088/1742-6596/1770/1/012068.
Full textAbstract:
Abstract Edge even graceful labeling is a novel graceful labelling, introduced in 2017 by Elsonbaty and Daoud. A graph G with p vertices and q edges is called an edge even graceful if there is a bijection f: E(G) → {2, 4,. . ., 2q} such that, when each vertex is assigned the sum of the labels of all edges incident to it mod 2k, where k = max (p, q), the resulting vertex labels are distinct. A labeling of G is called edge odd graceful labeling, if there exists a bijection f from the set of edges E(G) to the set {1,3,5,…,2q-1} such that the induced the map f* from the set of vertices V(G) to {0,1,2,.,.,2q-1} given by f*(u) = Σ uv∈E(G) f(uv) (mod 2q) is an injection. A graph which admits edge even (odd) graceful labeling is called an edge even (odd) graceful graph. Paley graphs are dense undirected graphs raised from the vertices as elements of an appropriate finite field by joining pairs of vertices that differ by a quadratic residue. In this paper, we study the construction of edge even (odd) graceful labeling for Paley graphs and prove that Paley graphs of prime order are edge even (odd) graceful.
20
Mkrtchyan, Vahan. "The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability." Journal of Graph Algorithms and Applications 28, no. 1 (May 16, 2024): 129–47. http://dx.doi.org/10.7155/jgaa.v28i1.2931.
Full textAbstract:
A $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to find a $k$-edge-colorable subgraph with maximum number of edges together with its $k$-edge-coloring. In this paper, we consider the maximum 2-edge-colorable subgraph problem and present some results that deal with the fixed-parameter tractability of this problem.
21
Bollinger, Eric K., and Thomas A. Gavin. "Responses of Nesting Bobolinks (Dolichonyx Oryzivorus) to Habitat Edges." Auk 121, no. 3 (July 1, 2004): 767–76. http://dx.doi.org/10.1093/auk/121.3.767.
Full textAbstract:
Abstract Avoidance of habitat edges may be contributing to reduced densities of grass-land birds in small habitat patches. Nest densities for grassland-nesting Bobolinks (Dolichonyx oryzivorus) were much lower than expected within 25 m of forest edges at three sites in New York, and that pattern (“edge avoidance”) extended to 100 m at one site. Nests located within 50 m of forest or wooded hedgerow edges had lower daily survival rates, compared with nests ≥100 m from any habitat edge. Bobolinks tended to move away from forest edges when renesting after nest failure; that pattern was especially evident in females that placed their first nest within 50 m of a forest or wooded hedgerow edge. Second nests of all seven of those females were farther from that edge type than their first nests. However, nest placement in relation to wooded edges did not vary significantly between years for those philopatric females nesting at our study sites for more than one year. Bobolinks also avoided nesting near road edges, even though nest survival rates were not lower near that edge type. However, Bobolinks did not appear to avoid nesting near edges adjacent to old fields or pastures. Nest survival near those edge types was higher than near wooded edges and similar to or higher than survival of nests ≥100 m from any edge. Thus, responses of Bobolinks to habitat edges were inconsistent, and nest success was dependent on type of edge.
22
Toyonaga, Kenji. "The location of classified edges due to the change in the geometric multiplicity of an eigenvalue in a tree." Special Matrices 7, no. 1 (January 1, 2019): 257–62. http://dx.doi.org/10.1515/spma-2019-0019.
Full textAbstract:
Abstract Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed. We investigate a necessary and sufficient condition for each classification of edges. We have similar results as the case for real symmetric matrices whose graph is a tree. We show that a g-2-Parter edge, a g-Parter edge and a g-downer edge are located separately from each other in a tree, and there is a g-neutral edge between them. Furthermore, we show that the distance between a g-downer edge and a g-2-Parter edge or a g-Parter edge is at least 2 in a tree. Lastly we give a combinatorially symmetric matrix whose graph contains all types of edges.
23
Petrou, M., and J. Kittler. "Optimal edge detectors for ramp edges." IEEE Transactions on Pattern Analysis and Machine Intelligence 13, no. 5 (May 1991): 483–91. http://dx.doi.org/10.1109/34.134047.
Full text
24
K.S, Kanzul Fathima, and Jahir Hussain R. "An Introduction to Fuzzy Edge Coloring." JOURNAL OF ADVANCES IN MATHEMATICS 11, no. 10 (January 28, 2016): 5742–48. http://dx.doi.org/10.24297/jam.v11i10.801.
Full textAbstract:
In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color. Fuzzy edge chromatic number of G is least positive integer for which G has a proper fuzzy edge coloring. In this paper, the fuzzy edge chromatic number of different classes of fuzzy graphs and the fuzzy edge chromatic number of fuzzy line graphs are found. Isochromatic fuzzy graph is also defined.
25
Suzuki, Masahiro, and Kazuhisa Yanaka. "Different latencies of edge detection cause the fluttering-heart illusion." Optical Review 28, no. 2 (February 16, 2021): 159–73. http://dx.doi.org/10.1007/s10043-021-00646-8.
Full textAbstract:
AbstractWe studied the mechanism causing the fluttering-heart illusion in which the motion of an inner figure appears unsynchronized compared with that of the outer figure surrounding it although the motion of both figures is objectively synchronized in reality. Experiment 1 examined the effect of edges’ luminance contrasts. The illusion was measured under conditions where the luminance contrasts of the outer and inner figures’ edges were varied. The results indicated that the illusion occurred when the outer figure’s edge had a high luminance contrast and the inner figure’s edge had a low luminance contrast and that the illusion was reversed when the outer figure’s edge had a low luminance contrast and the inner figure’s edge had a high luminance contrast. Experiment 2 examined the effect of the first- and second-order edges. The illusion was measured under conditions where the first- and second-order edges coexisted or only the first-order edges existed. The results indicated that the illusion occurred when the outer figure had the first-order edge and the inner figure had the second-order edge, and that the illusion was reversed when the outer figure had the second-order edge and the inner figure had the first-order edge. These findings supported the hypothesis that the different latencies of edge detection cause the fluttering-heart illusion.
26
Ji, Yu Rong, Ai Jun Li, and Jing Jing Yao. "On Edge-Balance Index Sets of the Graph CnxP6(n=3,4,5mod6)." Advanced Materials Research 339 (September 2011): 662–65. http://dx.doi.org/10.4028/www.scientific.net/amr.339.662.
Full textAbstract:
Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2 = {0,1}. For a given binary edge labeling f :E(G)→Z2 , the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v) =1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to v , otherwise f*(v) is idefined. For i∈Z2 , let v(i)=card{v∈V(G): f*(v) =i} and e(i) = card{e∈E(G) : f (e)=i}. The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0) −v(1) |: the edge labeling f satisfies |e(0)−e(1) |≤1}.In this paper, we completely determine the edge-balance CnxP 6(n=3,4,5mod6).
27
Kucharczuk, Natalia, Tomasz Wąs, and Oskar Skibski. "PageRank for Edges: Axiomatic Characterization." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 5108–15. http://dx.doi.org/10.1609/aaai.v36i5.20444.
Full textAbstract:
Edge centrality measures are functions that evaluate the importance of edges in a network. They can be used to assess the role of a backlink for the popularity of a website as well as the importance of a flight in virus spreading. Various node centralities have been translated to apply for edges, including Edge Betweenness, Eigenedge (edge version of eigenvector centrality), and Edge PageRank. With this paper, we initiate the discussion on the axiomatic properties of edge centrality measures. We do it by proposing an axiomatic characterization of Edge PageRank. Our characterization is the first characterization of any edge centrality measures in the literature.
28
Xiao, Chuan Min, Tian Lei Ma, and Ren Bo Xia. "An Edge Detection Algorithm Based on Human Visual System." Advanced Materials Research 760-762 (September 2013): 1519–23. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.1519.
Full textAbstract:
Edge detection is a fundamental problem in computer vision. In this paper, we present an effective algorithm to find salient edges from infrared scene images based on Human Visual System. The algorithm integrates three basic edge features: edge contrast, edge density and edge length. In this manner, the proposed algorithm works well to detect salient region boundaries and to suppress false edges from background and texture. The experimental results demonstrate the effectiveness of the proposed algorithm.
29
Zhang, Liu, Liu, Li, and Ye. "Edge Detection Algorithm of a Symmetric Difference Kernel SAR Image Based on the GAN Network Model." Symmetry 11, no. 4 (April 17, 2019): 557. http://dx.doi.org/10.3390/sym11040557.
Full textAbstract:
The symmetrical difference kernel SAR image edge detection algorithm based on the Canny operator can usually achieve effective edge detection of a single view image. When detecting a multi-view SAR image edge, it has the disadvantage of a low detection accuracy. An edge detection algorithm for a symmetric difference nuclear SAR image based on the GAN network model is proposed. Multi-view data of a symmetric difference nuclear SAR image are generated by the GAN network model. According to the results of multi-view data generation, an edge detection model for an arbitrary direction symmetric difference nuclear SAR image is constructed. A non-edge is eliminated by edge post-processing. The Hough transform is used to calculate the edge direction to realize the accurate detection of the edge of the SAR image. The experimental results show that the average classification accuracy of the proposed algorithm is 93.8%, 96.85% of the detection edges coincide with the correct edges, and 97.08% of the detection edges fall into the buffer of three pixel widths, whichshows that the proposed algorithm has a high accuracy of edge detection for kernel SAR images.
30
Zhang, Li, Lie Jun Wang, Sen Hai Zhong, and Gang Zhao. "Contents Based Color Image Edge Detection Using Hessian Matrix." Applied Mechanics and Materials 427-429 (September 2013): 1853–60. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.1853.
Full textAbstract:
The edges are the most fundamental and important characteristic of an image, edge detection is the key link and classic topic in machine vision and image processing. Considering the human visual characteristics, the intrinsic gradient direction information of color images was used to obtain the pseudo-color edges of the images by conducting multichannel edge detection. After enhancing the edge information and removing the correlation, the brightness is extracted in order to obtain complete image edge information. To make the edges more smooth and continuous, the Hessian matrix is used to remove coarse edges and edges with redundant background texture. The experiment verifies the effectiveness of the proposed algorithm, and the comparison with other scheme indicates that our scheme can improve the effectiveness, continuity and sharpness of edge detection.
31
Meddah, Nacéra, and Mustapha Chellali. "Edges contained in all or in no minimum edge dominating set of a tree." Discrete Mathematics, Algorithms and Applications 11, no. 04 (August 2019): 1950040. http://dx.doi.org/10.1142/s179383091950040x.
Full textAbstract:
In a graph, an edge dominates itself and all its adjacent edges. An edge dominating set (EDS) in a graph [Formula: see text] is a subset of edges that dominates every edge of [Formula: see text] In this paper, we characterize edges that are in all or in no minimum EDS in trees.
32
Kaiser, Sara A., and Catherine A. Lindell. "Effects of Distance to Edge and Edge Type on Nestling Growth and Nest Survival in the Wood Thrush." Condor 109, no. 2 (May 1, 2007): 288–303. http://dx.doi.org/10.1093/condor/109.2.288.
Full textAbstract:
Abstract Many studies investigating edge effects on forest-nesting birds have focused on nest success. Fewer have examined edge effects on other components of fitness. Nestling growth rates have been positively correlated with food availability, which may differ at edges compared to the forest interior. However, previous work has not examined growth as a function of distance to edge and edge type. We investigated whether edge type, distance to edge, hatching date, brood size, brood parasitism, year, and site influenced growth rates of wings, tarsi, and mass of nestling Wood Thrushes (Hylocichla mustelina) using regression tree analyses. Simultaneously, we examined edge effects on daily nest survival. We conducted our study in southwestern Michigan in 2002 and 2003. We located 175 nests and measured nestlings from 61 nests. Contrary to expectations, tarsal and mass growth rates were more rapid near edges than in the forest interior and tarsal growth rates were more rapid near gradual edge types than near abrupt edge types. Wing chord growth rates were more rapid in the forest interior than at edges. Mass and tarsal growth rates were more rapid later in the breeding season, when brood sizes were smaller. We found no effect of edge type or distance to edge on nest survival. The influence of edge on nestling growth rate but not nest survival suggests nestling growth rates may indicate edge-interior and edge type differences in habitat quality, even when high regional fragmentation levels overwhelm potential edge-interior differences in nest survival.
33
Smirnov, Alexander Valeryevich. "The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph." Modeling and Analysis of Information Systems 30, no. 1 (April 28, 2023): 6–15. http://dx.doi.org/10.18255/1818-1015-2023-1-6-15.
Full textAbstract:
In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of $k$ linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. As for an ordinary graph, we can define the integer function of the length of an edge for a multiple graph and set the problem of the shortest path joining two vertices. Any multiple path is a union of $k$ ordinary paths, which are adjusted on the linked edges of all multiple and multi-edges. In the article, we optimize the algorithm of finding the shortest path in an arbitrary multiple graph, which was obtained earlier. We show that the optimized algorithm is polynomial. Thus, the problem of the shortest path is polynomial for any multiple graph.
34
Khan, Sajid, Dong-Ho Lee, Muhammad Asif Khan, Muhammad Faisal Siddiqui, Raja Fawad Zafar, Kashif Hussain Memon, and Ghulam Mujtaba. "Image Interpolation via Gradient Correlation-Based Edge Direction Estimation." Scientific Programming 2020 (April 21, 2020): 1–12. http://dx.doi.org/10.1155/2020/5763837.
Full textAbstract:
This paper introduces an image interpolation method that provides performance superior to that of the state-of-the-art algorithms. The simple linear method, if used for interpolation, provides interpolation at the cost of blurring, jagging, and other artifacts; however, applying complex methods provides better interpolation results, but sometimes they fail to preserve some specific edge patterns or results in oversmoothing of the edges due to postprocessing of the initial interpolation process. The proposed method uses a new gradient-based approach that makes an intelligent decision based on the edge direction using the edge map and gradient map of an image and interpolates unknown pixels in the predicted direction using known intensity pixels. The input image is subjected to the efficient hysteresis thresholding-based edge map calculation, followed by interpolation of low-resolution edge map to obtain a high-resolution edge map. Edge map interpolation is followed by classification of unknown pixels into obvious edges, uniform regions, and transitional edges using the decision support system. Coefficient-based interpolation that involves gradient coefficient and distance coefficient is applied to obvious edge pixels in the high-resolution image, whereas transitional edges in the neighborhood of an obvious edge are interpolated in the same direction to provide uniform interpolation. Simple line averaging is applied to pixels that are not detected as an edge to decrease the complexity of the proposed method. Applying line averaging to smooth pixels helps to control the complexity of the algorithm, whereas applying gradient-based interpolation preserves edges and hence results in better performance at reasonable complexity.
35
Shirkande, Aparna S., Sakshi S. Sawant, Neha V. Shinde, and Sharanya S. Rao. "Edge Detection Techniques Using Character Segmentation for OCR of Devanagari Text." Journal of Signal Processing 9, no. 1 (February 15, 2023): 25–32. http://dx.doi.org/10.46610/josp.2023.v09i01.003.
Full textAbstract:
An image processing technique called edge detection is used to find and identify the edges, curves, and objects in digital images. Edge detection includes various mathematical calculations that focus on locating the edges and curves where a digital image's brightness abruptly shifts or has discontinuities. In the fields of feature detection and feature extraction in image processing and computer vision, edge detection is a fundamental tool. The application of an edge detector results in the development of a set of connected curves that represent surface marks, character boundaries, and discontinuities in surface orientation. Character boundaries are described via edges. The majority of a feature is described by its edges. A group of pixels called an edge is used to describe an area where abrupt variations in intensity occur. Because it removes items of interest for actions like description, segmentation is a vital stage in an image recognition system. This paper focuses on edge detection techniques that can be implemented on characters for effective character recognition. Devanagari text includes curvy edges which need to be detected for proper recognition hence different edge detector operators are implemented to find the most effective amongst them to acquire clear edges of the text. There are several methods for segmenting images, including segmentation based on artificial neural networks, clustering, edges, regions, and thresholds. In this paper, edge-based segmentation is used. The Canny, Laplacian, Sobel, Prewitt, and Robert operators are used to detect edges, and the generated image is compared to the original binary image. The pre-processing phase includes the binarization step.
36
Rajendra, R., and P. Siva Kota Reddy. "On Tosha-degree of an Edge in a Graph." European Journal of Pure and Applied Mathematics 13, no. 5 (December 27, 2020): 1097–109. http://dx.doi.org/10.29020/nybg.ejpam.v13i5.3710.
Full textAbstract:
In an earlier paper, we have introduced the Tosha-degree of an edge in a graph without multiple edges and studied some properties. In this paper, we extend the definition of Tosha-degree of an edge in a graph in which multiple edges are allowed. Also, we introduce the concepts - zero edges in a graph, $T$-line graph of a multigraph, Tosha-adjacency matrix, Tosha-energy, edge-adjacency matrix and edge energy of a graph $G$ and obtain some results.
37
Ji, Yu Rong, Ying Fang Zhang, and Yu Ge Zheng. "On Edge-Balance Index Sets of the Graph Cn×Pb(n=0,1,2mod6)." Applied Mechanics and Materials 143-144 (December 2011): 750–54. http://dx.doi.org/10.4028/www.scientific.net/amm.143-144.750.
Full textAbstract:
Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2=(0,1) For a given binary edge labeling f:E(G)→Z2,the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v)=1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to , otherwise f*(v) is undefined. For i∈Z2, let v(i)=card(e∈V(G):f*(v)=i) and e(i)=card(e∈E(G):f(e)=i). The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0)-v(1): the edge labeling f satisfies } . In this paper, we completely determine the edge-balance index |e(0)-e(1)|≤1 sets of the graph Cn×Pb(n=0,1,2 mod 6)
38
A. S., Saranya, and Santhosh Kumar K. R. "On the total edge irregularity strength of certain classes of cycle related graphs." Proyecciones (Antofagasta) 43, no. 1 (March 20, 2024): 53–67. http://dx.doi.org/10.22199/issn.0717-6279-5728.
Full textAbstract:
For a graph G=(V,E), an edge irregular total k-labeling is a labeling of the vertices and edges of G with labels from the set {1, 2, ..., k } such that any two different edges have distinct weights. The sum of the label of edge uv and the labels of vertices u and v determines the weight of the edge uv. The smallest possible k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. We determine the exact value of the total edge irregularity strength for some cycle related graphs.
39
Gu, Yunting, Jinguang Lv, Jian Bo, Baixuan Zhao, Kaifeng Zheng, Yingze Zhao, Jin Tao, Yuxin Qin, Weibiao Wang, and Jingqiu Liang. "An Improved Wavelet Modulus Algorithm Based on Fusion of Light Intensity and Degree of Polarization." Applied Sciences 12, no. 7 (March 31, 2022): 3558. http://dx.doi.org/10.3390/app12073558.
Full textAbstract:
Edge detection is the basis of image analysis and image processing. The wavelet modulus maxima algorithm is a widely used edge-detection algorithm. The algorithm has the advantages of strong anti-noise ability and high precision of edge location, but it still cannot accurately obtain edge information for low-contrast images. Therefore, this paper proposes an improved wavelet mode maximum edge algorithm for the fusion of light intensity and degree of polarization. The improved wavelet mode maximum algorithm was used to extract the edges of a light intensity image and degree of polarization image, and then refine and fuse the two edges to obtain the final edge information. Simulation experiments showed that the edge image obtained by the edge-detection algorithm in this paper had a clearer outline and better connectivity.
40
XIANG, LINYING, and GUANRONG CHEN. "MINIMAL EDGE CONTROLLABILITY OF DIRECTED NETWORKS." Advances in Complex Systems 22, no. 07n08 (November 2019): 1950017. http://dx.doi.org/10.1142/s0219525919500176.
Full textAbstract:
Minimal edge controllability of directed networks is investigated in this paper. A new edge dynamics model is first introduced with two nonzero parameters describing the linear relationship between the node states and the edge states. Three different digraphs as skeleton structures for minimal edge controllability are analyzed. The conditions ensuring both node controllability and edge controllability for these three digraphs are presented, respectively. It is found that cycles in these networks play an important role in edge controllability. The notion of minimal edge controllability is then extended to signed digraphs. It is shown that the minimal edge controllability of a signed cycle depends on the number of edges with negative weights, regardless of the placement of the negative weights on the edges. Some examples are presented for illustration and verification.
41
Mikolajczyk, Tadeusz, and Łukasz Romanowski. "Optimisation of Single Edge Tools Exploitation Process." Applied Mechanics and Materials 332 (July 2013): 431–36. http://dx.doi.org/10.4028/www.scientific.net/amm.332.431.
Full textAbstract:
Paper show possibilities to optimization of exploitation process of single edge tools. It decrease cost of machining using optimizing the use of the cutting edge. This possibility was presented for single edge tools in oblique and orthogonal cutting. In oblique cutting was presented optimizing the use of the cutting edge by partially exchange of active section of the cutting edge. It is shown for straight edges. Presents model of special tool and result of made experiments, which shows possibilities to increase tool life. Second presented possibilities is orthogonal cutting with round insert. Presented results of calculations of number cutting edges from one round insert by optimizing the use of the cutting edge. For orthogonal cutting was used normal market construction tools for round inserts. Presents first results of surface roughness for tools with worn up cutting edge and rotate for exchange this worn up fragment of cutting edge. In this case number of edges cutting insert increase many times. This can many times reduce the cost of tools in cutting especially in turning.
42
Hwang, Haeseong, Seungho Han, and Hyunseop Lee. "An Analysis of Edge Chipping in LiTaO3 Wafer Grinding Using a Scratch Test and FEA Simulation." Lubricants 11, no. 7 (July 16, 2023): 297. http://dx.doi.org/10.3390/lubricants11070297.
Full textAbstract:
Lithium tantalite (LiTaO3) is a representative multifunctional single-crystal material with electro-optical, acoustic, piezoelectric, pyroelectric, and nonlinear optical properties used as a substrate for surface acoustic wave (SAW) devices. To enhance SAW device performance, thinner LiTaO3 substrates with improved surface roughness are desired. Chemical mechanical polishing (CMP) is employed to achieve the desired surface roughness after grinding. However, the thinning process increases the risk of substrate fracture, especially at the edges, resulting in edge chipping. Edge chipping can lead to complete substrate failure during SAW device fabrication, requiring an effective wafer geometry to prevent it. The study utilizes scratch tests and finite element analysis (FEA) to identify the optimal edge shape (C-cut, trimmed, and thinned) for preventing edge chipping on LiTaO3 wafers. The C-cut edge refers to the rounding of the wafer’s edge, while the trimmed edge refers to the machining of the wafer’s edge to be perpendicular to the wafer surface. As a result of the scratch tests, we observed edge-chipping lengths of 115 and 227 μm on the C-cut and trimmed edges, respectively, while the thinned edge (half C-cut) resulted in complete wafer fracture. In the finite element analysis (FEA), edge-chipping lengths of 80, 120, and 150 μm were obtained on the C-cut, trimmed, and thinned edges (half C-cut), respectively. In conclusion, it has been confirmed that the C-cut, trimmed, and thinned edge shapes are effective in preventing edge chipping. However, considering that the C-cut edge shape becomes thinner through grinding, using the trimmed edge shape appears to be the most effective.
43
Supriyatin, Wahyu. "Perbandingan Metode Sobel, Prewitt, Robert dan Canny pada Deteksi Tepi Objek Bergerak." ILKOM Jurnal Ilmiah 12, no. 2 (August 27, 2020): 112–20. http://dx.doi.org/10.33096/ilkom.v12i2.541.112-120.
Full textAbstract:
Computer vision is one of field of image processing. To be able to recognize a shape, it requires the initial stages in image processing, namely as edge detection. The object used in tracking in computer vision is a moving object (video). Edge detection is used to recognize edges of objects and reduce existing noise. Edge detection algorithms used for this research are using Sobel, Prewitt, Robert and Canny. Tests were carried out on three videos taken from the Matlab library. Testing is done using Simulik Matlab tools. The edge and overlay test results show that the Prewitt algorithm has better edge detection results compared to other algorithms. The Prewitt algorithm produces edges whose level of accuracy is smoother and clearer like the original object. The Canny algorithm failed to produce an edge on the video object. The Sobel and Robert algorithm can detect edges, but it is not clear as Prewitt does, because there are some missing edges.
44
Magura, Tibor, and Gábor L. Lövei. "The type of forest edge governs the spatial distribution of different-sized ground beetles." Acta Zoologica Academiae Scientiarum Hungaricae 66, Suppl. (December 28, 2020): 69–96. http://dx.doi.org/10.17109/azh.66.suppl.69.2020.
Full textAbstract:
Worldwide human-induced habitat fragmentation intensifies the emergence of forest edges. In addition to these edges, there are edges evolved by natural processes. Edge-maintaining processes (natural vs. anthropogenic) fundamentally determine edge responses, and thus edge functions. Species with various traits show fundamentally different edge response, therefore the trait-based approach is essential in edge studies. We evaluated the edge effect on the body size of ground beetles in forest edges with various maintaining processes. Our results, based on 30 published papers and 221 species, showed that natural forest edges were impenetrable for small species, preventing their dispersal into the forest interiors, while both the medium and the large species penetrated across these edges and dispersed into the forest interiors. Anthropogenic edges maintained by continued human disturbance (agriculture, forestry, urbanisation) were permeable for ground beetles of all size, allowing them to invade the forest interiors. Overwintering type (overwintering as adults or as larvae) was associated with body size, since almost two-thirds of the small species, while slightly more than a third of both the medium and the large species were adult overwintering. Based on this, size-dependent permeability of natural edges may be related to overwintering type, which basically determines species tolerance to human disturbance.
45
Fletcher, Robert J., and Rolf R. Koford. "Spatial Responses of Bobolinks (Dolichonyx Oryzivorus) Near Different Types of Edges in Northern Iowa." Auk 120, no. 3 (July 1, 2003): 799–810. http://dx.doi.org/10.1093/auk/120.3.799.
Full textAbstract:
Abstract Habitat edges are well-studied components of fragmented landscapes, yet factors mediating edge effects remain unclear. We report how different types of edges surrounding patches may affect spatial distributions of Bobolink (Dolichonyx oryzivorus), a declining, area-sensitive songbird that breeds in grasslands. We expected Bobolinks to be less abundant near edges, and we investigated a set of alternative hypotheses for explaining that spatial pattern: (1) passive displacement, in which individuals do not avoid edges but use edges as boundaries for territories; (2) habitat gradients, in which individuals respond to habitat structure gradients near edges; (3) territory size, in which size of territories increases near edges; and (4) active avoidance, in which individuals actively avoid edges by positioning territory boundaries away from edges. To examine those hypotheses, we surveyed Bobolinks in grassland habitats near 34 edges of three different edge types (agriculture, road, and woodland) in northern Iowa, 1999–2000. Bobolink density was lower near woodland edges than near other edge types, and density increased as a function of distance from edge for all edge types. There was no evidence for a habitat gradient close to edges, but there was some evidence for habitat structure differing among edge types. Territory size increased near roads, decreased near woodlands, but did not change near agricultural edges. Territory positioning was consistent with active avoidance near woodland edges, and to a lesser extent road edges, but positioning was only consistent with passive displacement near agriculture edges. We conclude that land use surrounding patches can have variable effects on territorial dynamics and habitat use of this area-sensitive species. Linking edge avoidance with fitness is needed to understand the demographic consequences of those responses for species in fragmented landscapes.
46
Yan, Wen Zhong, and Da Zhi Deng. "Study of Image Edge Detection Techniques." Advanced Materials Research 505 (April 2012): 393–96. http://dx.doi.org/10.4028/www.scientific.net/amr.505.393.
Full textAbstract:
Edges characterize boundaries. Edge detection is a problem of fundamental importance in image processing. The key of edge detection for image is to detect more edge details, reduce the noise impact to the largest degree. In this paper the comparative analysis of various image edge detection techniques is presented. In order to evaluate these techniques, they are used to detect the edge of chromosome image. Firstly, the iterative thresholding algorithm and morphologic erode algorithm together are applied to enhance both the edges of the chromosomes and the contrast of the image. Then, Sobel operator technique, Roberts technique, Prewitt technique and Canny technique are used respectively to detect the edges of the chromosomes in the image.
47
Bao, Kejie, and Junyi Zhu. "A brief review of reconstructions and electronic structures of MoS2 zigzag edges." Journal of Applied Physics 132, no. 8 (August 28, 2022): 080702. http://dx.doi.org/10.1063/5.0098639.
Full textAbstract:
Transition metal dichalcogenides, mainly focusing on MoS2, have attracted intensive studies in terms of their electronic and optical properties. Their lower-dimensional counterparts, such as nanoribbons and nanoclusters, gradually draw more research attention because of their potential applications in various electronic and spintronic devices. The edge states are essential to determine the intriguing electronic and magnetic properties of the nanocrystals. In this review, we mainly focus on the zigzag edges in the MoS2 system because they are more common in experiments. We first review the physical properties of the unreconstructed edges and then introduce the principles of edge reconstructions, the electron counting model (ECM). Then, based on the ECM, intrinsic edge reconstructions with different periodicities are discussed. The literature we reviewed suggests that the conductivities and magnetism of the edge states are highly related to the periodicities of the edges. Finally, the effects of the edge passivation with extrinsic atoms are reviewed. Edge passivation plays an important role in tuning the electronic and magnetic properties of the edge states and determining the morphology during the crystal growth. Furthermore, MoS2 zigzag edges could be an ideal platform to investigate the interplay between the edge states with different periodicities and magnetic dopants in the future.
48
Zangpo, Jigme, and Hirokazu Kobayashi. "Isolation of phase edges using off-axis q-plate filters." Optics Express 32, no. 7 (March 22, 2024): 12911. http://dx.doi.org/10.1364/oe.517822.
Full textAbstract:
Edge-enhanced microscopes with a q-plate have attracted more attention to enhance the edges of phase-amplitude objects in biological samples due to their capacity for all-directional edge enhancement, while differential interference-contrast microscopy enhances edges in only one-direction. However, the edge-enhanced microscopes cannot distinguish the edges of phase and amplitude objects, as both edges are equally enhanced. This study introduces a novel method for isolating the edge of a phase object from an amplitude object using an off-axis q-plate filter in a 4f system. Herein, we combined off-axis q-plates with four different displacements to isolate the phase object edge from the amplitude object. To demonstrate the proposed method, we conducted experiments using two distinct samples. The first sample comprised a phase test target surrounded by an aperture, and the second sample involved an overlap between the phase test target and a white hair with non-zero transmittance. In the samples, the isolated phase object edge is in good agreement with the theoretical expectations, and the amplitude object edge was reduced by approximately 93%. The proposed method is a novel and effective approach for isolating the edge of a phase object from an amplitude object and can be useful in various biological imaging applications.
49
Smirnov, Alexander V. "NP-completeness of the Eulerian walk problem for a multiple graph." Modeling and Analysis of Information Systems 31, no. 1 (March 28, 2024): 102–14. http://dx.doi.org/10.18255/1818-1015-2024-1-102-114.
Full textAbstract:
In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of $k$ linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. We study the problem of finding the Eulerian walk (the cycle or the trail) in a multiple graph, which generalizes the classical problem for an ordinary graph. We prove that the recognition variant of the multiple eulerian walk problem is NP-complete. For this purpose we first prove NP-completeness of the auxiliary problem of recognising the covering trails with given endpoints in an ordinary graph.
50
Boekstegers, P. "„Edge-to-edge repair“." Herz 44, no. 7 (October 18, 2019): 586–91. http://dx.doi.org/10.1007/s00059-019-04847-5.
Full text