Efficient Superimposition Recovering Algorithm

نویسندگان

  • Han Li
  • Kun Gai
  • Pinghua Gong
  • Changshui Zhang
چکیده

In this article, we address the issue of recovering latent transparent layers from superimposition images. Here, we assume we have the estimated transformations and extracted gradients of latent layers. To rapidly recover high-quality image layers, we propose an Efficient Superimposition Recovering Algorithm (ESRA) by extending the framework of accelerated gradient method. In addition, a key building block (in each iteration) in our proposed method is the proximal operator calculating. Here we propose to employ a dual approach and present our Parallel Algorithm with Constrained Total Variation (PACTV) method. Our recovering method not only reconstructs high-quality layers without color-bias problem, but also theoretically guarantees good convergence performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimum superimposition of protein structures: ambiguities and implications.

BACKGROUND Techniques for comparison and optimum superimposition of protein structures are indispensable tools, providing the basis for statistical analysis, modeling, prediction and classification of protein folds. Observed similarity of structures is frequently interpreted as an indication of evolutionary relatedness. A variety of advanced techniques are available, but so far the important is...

متن کامل

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

Synchronization of musical words

We study the synchronization of musical sequences by means of an operation defined on finite or infinite words called superimposition. This operation can formalize basic musical structures such as melodic canons, for which we provide a construction based on the superimposition of infinite words. In the case of circular canons, we present an enumeration algorithm involving Lyndon words, which ap...

متن کامل

Increasing the Efficiency of the Software Architecture Recovery through Spanning Tree Based Maximal Graph Mining Technique

This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed in this context, for example Apriori base...

متن کامل

On Linear Finite Elements for Simultaneously Recovering Source Location and Intensity

Linear elements are least expensive finite elements for simultaneously recovering the source location and intensity in a general convection-diffusion process. However, the derivatives of the least-squares objective functional with Tikhonov regularizations are not well-defined when linear finite elements are used. In this work we provide a systematic formulation of the numerical inversion using ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1211.4307  شماره 

صفحات  -

تاریخ انتشار 2012