Results 271 to 280 of about 4,243,261 (296)
Some of the next articles are maybe not open access.
Separating disconnected quadratic level sets by other quadratic level sets
Journal of Global Optimization, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huu-Quang Nguyen +2 more
openaire +1 more source
The American Mathematical Monthly, 2014
We prove that every continuous function from a disk to the real line has a level set containing a connected component of diameter at least .
Aleksander Maliszewski +1 more
openaire +1 more source
We prove that every continuous function from a disk to the real line has a level set containing a connected component of diameter at least .
Aleksander Maliszewski +1 more
openaire +1 more source
Setting euthanasia on the level
The Liverpool Law Review, 1993The House of Lords recently set up a Select Committee on Medical Ethics to consider euthanasia and related medical decisions at the end of life. This followed widespread publicity surrounding recent cases, particular the trial and conviction of a doctor for the attempted murder of a consenting terminally ill patient, and the House of Lords' ruling that
Tim, Helme, Nicola, Padfield
openaire +2 more sources
Journal of Cybernetics, 1977
Abstract In practical applications of fuzzy set theory, e.g., in pattern recognition, information retrieval, etc., the reader is not advised-for the reasons of the amount of the considered object universal set and the capacity of computer memory involved-to consider fuzzy sets defined in the whole universal set, when it is sufficient-from the point of ...
openaire +2 more sources
Abstract In practical applications of fuzzy set theory, e.g., in pattern recognition, information retrieval, etc., the reader is not advised-for the reasons of the amount of the considered object universal set and the capacity of computer memory involved-to consider fuzzy sets defined in the whole universal set, when it is sufficient-from the point of ...
openaire +2 more sources
2010
We define the robustness of a level set homology class of a function f : X → R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology.
Paul Bendich +3 more
openaire +1 more source
We define the robustness of a level set homology class of a function f : X → R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology.
Paul Bendich +3 more
openaire +1 more source
Neuron segmentation with level sets
2013 Asilomar Conference on Signals, Systems and Computers, 2013We propose a variational scheme for neuron segmentation. The growing demand for an automated image analysis tool for efficient segmentation of neurites has led to significant focus and advancement in the field of neuro-image analysis. However, the complex structure of the neurites and imaging artifacts pose considerable challenge for automated image ...
Suvadip Mukherjee +2 more
openaire +1 more source
Level set estimation on the sphere
2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010We investigate a technique for estimating level sets of functionals on the 2-sphere. The surface of the sphere is finely partitioned using a tree decomposition and a candidate level set is obtained by minimizing a regularized cost on the tree. A cycle spinning scheme, implemented as an ensemble classification method, is developed to decrease the ...
Alexander Lorbert, Peter J. Ramadge
openaire +1 more source
ACM SIGGRAPH 2004 Sketches on - SIGGRAPH '04, 2004
The RLE sparse level set representation has many beneficial characteristics: (1) highly scalable, (2) fast to access randomly, (3) sequential traversal of the narrow band is optimal, (4) approximate distance values are provided throughout the bounding volume, and (5) easily adapted to work with the large majority of existing level set methods developed
Ben Houston +2 more
openaire +1 more source
The RLE sparse level set representation has many beneficial characteristics: (1) highly scalable, (2) fast to access randomly, (3) sequential traversal of the narrow band is optimal, (4) approximate distance values are provided throughout the bounding volume, and (5) easily adapted to work with the large majority of existing level set methods developed
Ben Houston +2 more
openaire +1 more source
2014
In this paper, we consider saliency detection problems from a unique perspective. We provide an implicit representation for the saliency map using level set evolution (LSE), and then combine LSE approach with energy functional minimization (EFM). Instead of introducing sophisticated segmentation procedures, we propose a flexible and lightweight LSE-EFM
Jincheng Mei, Bao-Liang Lu
openaire +1 more source
In this paper, we consider saliency detection problems from a unique perspective. We provide an implicit representation for the saliency map using level set evolution (LSE), and then combine LSE approach with energy functional minimization (EFM). Instead of introducing sophisticated segmentation procedures, we propose a flexible and lightweight LSE-EFM
Jincheng Mei, Bao-Liang Lu
openaire +1 more source
Mutual Segmentation with Level Sets
2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06), 2006We suggest a novel variational approach for mutual segmentation of two images of the same object. The images are taken from different views, related by projective transformation. Each of the two images may not provide sufficient information for correct object-background delineation.
Tammy Riklin-Raviv +2 more
openaire +1 more source