Metal in CT-imaged objects drastically reduces the quality of these images due to the severe artifacts it can cause. Most metal artifacts reduction (MAR) algorithms consider the metal-affected sinogram portions as the corrupted data and replace them via sophisticated interpolation methods. While these schemes are successful in removing the metal artifacts, they fail to recover some of the edge ...

Precise liver segmentation in abdominal MRI images is one of the most important steps for the computer-aided diagnosis of liver pathology. The first and essential step for diagnosis is automatic liver segmentation, and this process remains challenging. Extensive research has examined liver segmentation; however, it is challenging to distinguish which algorithm produces more precise segmentation...

The threshold need artificial hypothesis in the existing edge detection algorithm. In response to this phenomenon, we propose an edge detection algorithm is based on adaptive threshold. Article algorithm was studying the characteristics of wavelet transform. And it was combined with the traditional edge detection algorithm to reset the threshold. So we can use this adaptive Threshold to search ...

data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. it transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...

Let H be a graph with a designated vertex s, where edges are weighted by nonnegative reals. Splitting edges e = {u, s} and e′ = {s, v} at s is an operation that reduces the weight of each of e and e′ by a real δ > 0 while increasing the weight of edge {u, v} by δ. It is known that all edges incident to s can be split off while preserving the edge-connectivity of H and that such a complete split...

Given a graph G = (V,E) with a subset S ⊆ E of edges, the edge subset feedback edge set problem is to find a smallest set F of edges such that in G′ = (V,E − F ) no cycle contains an edge in S. We also define a restricted version of this problem, in which no edges in S is allowed to be selected into F to form a solution. In this paper, we give a linear-time algorithm for the edge subset feedbac...

Many applications such as information retrieval and classification, involve measuring graph distance or similarity, i.e., matching graphs to identify and quantify their common features. Different kinds of graph matchings have been proposed, giving rise to different graph similarity or distance measures. Graph matchings may be univalent – when each vertex is associated with at most one vertex of...