Готові списки джерел за темами / LAPLACIAN MATTE

Добірка наукової літератури з теми "LAPLACIAN MATTE"

Автор: Grafiati
Опубліковано: 11 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "LAPLACIAN MATTE".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "LAPLACIAN MATTE"

1

TAN, GUANGHUA, JUN QI, CHUNMING GAO, JIN CHEN, and LIYUAN ZHUO. "SALIENCY-BASED UNSUPERVISED IMAGE MATTING." International Journal of Pattern Recognition and Artificial Intelligence 28, no. 04 (June 2014): 1454001. http://dx.doi.org/10.1142/s0218001414540019.

Повний текст джерела
Анотація:
Spectral matting is the state-of-the-art matting method and can well solve the highly under-conditioned matte problem without manual intervention. However, it suffers from huge computation cost and inaccurate alpha matte. This paper presents a modified spectral matting method which combines saliency detection algorithm to get a higher accuracy of alpha matte with less computational cost. First, the saliency detection algorithm is used to detect general locations of foreground objects. For saliency detection method, original two-stage scheme is replaced by feedback scheme to get a more suitable saliency map for unsupervised image matting. Next, matting components are obtained through a linear transformation of the smallest eigenvectors of the matting Laplacian matrix. Then, the improved saliency map is used for grouping matting components. Finally, the alpha matte is obtained based on matte cost function. Experiments show that the proposed method outperforms the state-of-the-art methods based on spectral matting both in speed and alpha matte accuracy.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ju, Tingting, Meifeng Dai, Changxi Dai, Yu Sun, Xiangmei Song, and Weiyi Su. "Applications of Laplacian spectrum for the vertex–vertex graph." Modern Physics Letters B 33, no. 17 (June 18, 2019): 1950184. http://dx.doi.org/10.1142/s0217984919501847.

Повний текст джерела
Анотація:
Complex networks have attracted a great deal of attention from scientific communities, and have been proven as a useful tool to characterize the topologies and dynamics of real and human-made complex systems. Laplacian spectrum of the considered networks plays an essential role in their network properties, which have a wide range of applications in chemistry and others. Firstly, we define one vertex–vertex graph. Then, we deduce the recursive relationship of its eigenvalues at two successive generations of the normalized Laplacian matrix, and we obtain the Laplacian spectrum for vertex–vertex graph. Finally, we show the applications of the Laplacian spectrum, i.e. first-order network coherence, second-order network coherence, Kirchhoff index, spanning tree, and Laplacian-energy-like.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

DING, QINGYAN, WEIGANG SUN, and FANGYUE CHEN. "APPLICATIONS OF LAPLACIAN SPECTRA ON A 3-PRISM GRAPH." Modern Physics Letters B 28, no. 02 (January 8, 2014): 1450009. http://dx.doi.org/10.1142/s0217984914500092.

Повний текст джерела
Анотація:
In this paper, we calculate the Laplacian spectra of a 3-prism graph and apply them. This graph is both planar and polyhedral, and belongs to the generalized Petersen graph. Using the regular structures of this graph, we obtain the recurrent relationships for Laplacian matrix between this graph and its initial state — a triangle — and further derive the corresponding relationships for Laplacian eigenvalues between them. By these relationships, we obtain the analytical expressions for the product and the sum of the reciprocals of all nonzero Laplacian eigenvalues. Finally we apply these expressions to calculate the number of spanning trees and mean first-passage time (MFPT) and see that the scaling of MFPT with the network size N is N2, which is larger than those performed on some uniformly recursive trees.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Dai, Meifeng, Tingting Ju, Yongbo Hou, Jianwei Chang, Yu Sun, and Weiyi Su. "Coherence analysis of a family of weighted star-composed networks." International Journal of Modern Physics B 33, no. 23 (September 20, 2019): 1950264. http://dx.doi.org/10.1142/s0217979219502643.

Повний текст джерела
Анотація:
Recently, the study of many kinds of weighted networks has received the attention of researchers in the scientific community. In this paper, first, a class of weighted star-composed networks with a weight factor is introduced. We focus on the network consistency in linear dynamical system for a class of weighted star-composed networks. The network consistency can be characterized as network coherence by using the sum of reciprocals of all nonzero Laplacian eigenvalues, which can be obtained by using the relationship of Laplacian eigenvalues at two successive generations. Remarkably, the Laplacian matrix of the class of weighted star-composed networks can be represented by the Kronecker product, then the properties of the Kronecker product can be used to obtain conveniently the corresponding characteristic roots. In the process of finding the sum of reciprocals of all nonzero Laplacian eigenvalues, the key step is to obtain the relationship of Laplacian eigenvalues at two successive generations. Finally, we obtain the main results of the first- and second-order network coherences. The obtained results show that if the weight factor is 1 then the obtained results in this paper coincide with the previous results on binary networks, otherwise the scalings of the first-order network coherence are related to the node number of attaching copy graph, the weight factor and generation number. Surprisingly, the scalings of the first-order network coherence are independent of the node number of initial graph. Consequently, it will open up new perspectives for future research.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

KARAMANOS, K., S. I. MISTAKIDIS, T. J. MASSART, and I. S. MISTAKIDIS. "ENTROPY PRODUCTION OF ENTIRELY DIFFUSIONAL LAPLACIAN TRANSFER AND THE POSSIBLE ROLE OF FRAGMENTATION OF THE BOUNDARIES." Fractals 23, no. 03 (July 31, 2015): 1550026. http://dx.doi.org/10.1142/s0218348x15500267.

Повний текст джерела
Анотація:
The entropy production and the variational functional of a Laplacian diffusional field around the first four fractal iterations of a linear self-similar tree (von Koch curve) is studied analytically and detailed predictions are stated. In a next stage, these predictions are confronted with results from numerical resolution of the Laplace equation by means of Finite Elements computations. After a brief review of the existing results, the range of distances near the geometric irregularity, the so-called "Near Field", a situation never studied in the past, is treated exhaustively. We notice here that in the Near Field, the usual notion of the active zone approximation introduced by Sapoval et al. [M. Filoche and B. Sapoval, Transfer across random versus deterministic fractal interfaces, Phys. Rev. Lett. 84(25) (2000) 5776;1 B. Sapoval, M. Filoche, K. Karamanos and R. Brizzi, Can one hear the shape of an electrode? I. Numerical study of the active zone in Laplacian transfer, Eur. Phys. J. B. Condens. Matter Complex Syst. 9(4) (1999) 739-753.]2 is strictly inapplicable. The basic new result is that the validity of the active-zone approximation based on irreversible thermodynamics is confirmed in this limit, and this implies a new interpretation of this notion for Laplacian diffusional fields.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

He, Jiaojiao, Meifeng Dai, Yue Zong, Jiahui Zou, Yu Sun, and Weiyi Su. "Coherence analysis of a class of weighted tree-like polymer networks." Modern Physics Letters B 32, no. 05 (February 20, 2018): 1850064. http://dx.doi.org/10.1142/s0217984918500641.

Повний текст джерела
Анотація:
Complex networks have elicited considerable attention from scientific communities. This paper investigates consensus dynamics in a linear dynamical system with additive stochastic disturbances, which is characterized as network coherence by the Laplacian spectrum. Firstly, we introduce a class of weighted tree-like polymer networks with the weight factor. Then, we deduce the recursive relationship of the eigenvalues of Laplacian matrix at two successive generations. Finally, we calculate the first- and second-order network coherence quantifying as the sum and square sum of reciprocals of all nonzero Laplacian eigenvalues. The obtained results show that the scalings of first-order coherence with network size obey four laws along with the range of the weight factor and the scalings of second-order coherence with network size obey five laws along with the range of the weight factor.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Dai, Changxi, Meifeng Dai, Tingting Ju, Xiangmei Song, Yu Sun, and Weiyi Su. "Eigentime identity of the weighted (m,n)-flower networks." International Journal of Modern Physics B 34, no. 18 (July 1, 2020): 2050159. http://dx.doi.org/10.1142/s0217979220501593.

Повний текст джерела
Анотація:
The eigentime identity for random walks on the weighted networks is the expected time for a walker going from a node to another node. Eigentime identity can be studied by the sum of reciprocals of all nonzero Laplacian eigenvalues on the weighted networks. In this paper, we study the weighted [Formula: see text]-flower networks with the weight factor [Formula: see text]. We divide the set of the nonzero Laplacian eigenvalues into three subsets according to the obtained characteristic polynomial. Then we obtain the analytic expression of the eigentime identity [Formula: see text] of the weighted [Formula: see text]-flower networks by using the characteristic polynomial of Laplacian and recurrent structure of Markov spectrum. We take [Formula: see text], [Formula: see text] as example, and show that the leading term of the eigentime identity on the weighted [Formula: see text]-flower networks obey superlinearly, linearly with the network size.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Abanov, Ar, M. Mineev-Weinstein, and A. Zabrodin. "Self-similarity in Laplacian Growth." Physica D: Nonlinear Phenomena 235, no. 1-2 (November 2007): 62–71. http://dx.doi.org/10.1016/j.physd.2007.04.012.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Alekseev, Oleg. "Martingales of stochastic Laplacian growth." Physica D: Nonlinear Phenomena 412 (November 2020): 132629. http://dx.doi.org/10.1016/j.physd.2020.132629.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Liu, Qun. "Spectral analysis for weighted iterated pentagonal graphs and its applications." Modern Physics Letters B 34, no. 28 (June 10, 2020): 2050308. http://dx.doi.org/10.1142/s021798492050308x.

Повний текст джерела
Анотація:
Deterministic weighted networks have been widely used to model real-world complex systems. In this paper, we study the weighted iterated pentagonal networks. From the construction of the network, we derive recursive relations of all eigenvalues and their multiplicities of its normalized Laplacian matrix from the two successive generations of the weighted iterated pentagonal networks. As applications of spectra of the normalized Laplacian matrix, we study the Kemeny’s constant, the multiplicative degree-Kirchhoff index, and the number of weighted spanning trees and derive their exact closed-form expressions for the weighted iterated pentagonal networks.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "LAPLACIAN MATTE"

1

Grebenkov, Denis. "Transport Laplacien aux interfaces irrégulière : Etude théorique, numérique et expérimentale." Phd thesis, Ecole Polytechnique X, 2004. http://pastel.archives-ouvertes.fr/pastel-00000853.

Повний текст джерела
Анотація:
L'objectif premier de cette thèse est le développement d'une approche théorique des divers phénomènes de transport laplacien aux interfaces irrégulières: diffusion stationnaire à travers des membranes semi-perméables, transport électrique vers une électrode non bloquante dans un électrolyte, catalyse hétérogène sur une surface catalytique. L'influence de l'irrégularité géométrique, qui joue un rôle primordial dans ces phénomènes, peut être intégralement prise en compte à l'aide d'un opérateur purement mathématique, dit opérateur de Dirichlet-Neumann. Ses propriétés spectrales déterminent complètement la réponse linéaire d'un système considéré. Une étude numérique approfondie des différents aspects du transport laplacien aux interfaces irrégulières, modélisées ici par des frontières de Von Koch déterministes ou stochastiques, a apporté de nombreux résultats dont les plus importants sont: mise en évidence de la très faible proportion de modes propres de l'opérateur de Dirichlet-Neumann contribuant à l'impédance de la frontière, interprétation des valeurs propres de cet opérateur comme inverses des longueurs caractéristiques de l'interface, déduction d'un modèle analytique de l'impédance. En particulier, le modèle mathématique développé, qui exploite la hiérarchie des échelles caractéristiques, permet d'étudier des préfractales d'ordre très élevé. L'étude numérique de la mesure harmonique, dont la densité représente les probabilités de premier contact (analogue du courant primaire en électrochimie), a d'ailleurs permis de mettre au point une méthode de marches aléatoires rapides adaptées aux frontières de Von Koch considérées et de déterminer les dimensions multifractales avec une très bonne précision. Enfin, l'étude expérimentale avec une électrode de Von Koch a montré que cette approche théorique permet de prendre en compte l'irrégularité géométrique sans connaître le mécanisme de transport microscopique, ce qui ouvre toute une nouvelle branche d'applications possibles en électrochimie ou dans d'autres domaines.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

SINGH, PRABH PREET. "DEHAZING USING LIFTING WAVELET AND LAPLACIAN MATTE." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/15391.

Повний текст джерела
Анотація:
This work presents single image dehazing based on dark channel prior. Firstly, lifting haar wavelet has been used to decompose the hazy image into approximation and details. Then only the approximation component which is just one-fourth of the actual image dimension is further processed for dehazing. The dark channel prior used in the proposed work for dehazing is based on statistics of haze free images. The property that the intensity of dark channel gives approximate thickness of the haze is used to estimate the transmission and atmospheric light. Instead of constant airlight, proposed method employs scene depth to estimate spatially varying atmospheric light as it truly occurs in nature. Haze imaging model together with soft matting method has been used in this work to obtain a high quality haze free image. Experimental results demonstrate that the proposed approach produces better results as color fidelity and contrast of haze free image are improved and no over saturation in the sky region is observed. Further, with the use of lifting wavelet transform, reduction in computational time by a factor of two to three as compared to the conventional approach has been observed.
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "LAPLACIAN MATTE"

1

Fox, Robert. Laplace and the Physics of Short-Range Forces. Edited by Jed Z. Buchwald and Robert Fox. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199696253.013.14.

Повний текст джерела
Анотація:
This article focuses on Pierre Simon Laplace’s contributions to the physics of short-range forces. Laplacian physics can be interpreted as an attempt to realize a supposedly Newtonian ideal of a science that would account for all phenomena in terms of attractive or repulsive central forces acting between the particles of matter. Laplace formulated and pursued a programme between the 1790s and his death in1827 based on Isaac Newton’s ideas, but it also incorporated theories with a less direct Newtonian pedigree. The most important of these were the theories of the imponderable property-bearing fluids of heat (commonly known as caloric), light, electricity, and magnetism. Laplace first engaged with questions relating to the imponderable fluids in the context of his early experimental work on heat in the 1770s. This article first discusses Laplace’s programme before considering his association with the First Class of the French Institute and his legacy.
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "LAPLACIAN MATTE"

1

MacDougall, Preston J., and M. Creon Levit. "Probing Electron Dynamics with the Laplacian of the Momentum Density." In A Matter of Density, 257–70. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118431740.ch10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

"On conformally covariant differential operators and spectral theory of the holographic Laplacian." In Space – Time – Matter, 90–115. De Gruyter, 2018. http://dx.doi.org/10.1515/9783110452150-004.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "LAPLACIAN MATTE" для конкретних типів джерел:
Статті в журналах
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії