Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
We propose to measure quantitatively the opacity property of each pixel in a ground-glass opacity tumor from CT images. Our method results in an opacity map in which each pixel tak...
Yuanjie Zheng, Chandra Kambhamettu, Thomas Bauer...