In the normal coloring of a graph, if there is at least one vertex in each color class and it has at least one adjacent point in other color classes, such normal coloring is called b - coloring, and such points are called b - points. Let G have the maximum k value of b - k -dyeing called b -chromatic number, which is recorded as φ(G). Similarly, b -edge coloring and the chromatic number of the graph is φ'(G).
Image restoration is a hot issue in the field of image processing. Traditional algorithms approach the original function by a regular function or remove redundant noise by similarity. This process is complicated and cumbersome. In this paper, the low rank approximate matrix of the image matrix is equivalent to the product of two smaller matrices. At the same time, the first-order and second-order statistical information of the image matrix is effectively maintained by using the matrix Frobenius norm and matrix kernel normal. Secondly, the alternating direction multiplier method is utilized to solve the model. Finally, experimental results test the effectiveness of the proposed algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.