Removing shadows in a single image has been a challenging problem because shadows can appear in various forms due to complex physical situations, influenced by many factors such as light sources and the material’s transparency. In order to remove shadows precisely, most previous works utilized shadow mask information, which indicates the shadow region in a given image using binary representation. However, shadow mask utilization inevitably induces multiple problems, including shadow removal performance dependency and additional shadow detection process requirements. To solve these problems, the proposed algorithm is based on an image-to-image translation algorithm, which does not require additional shadow mask information. In this deep neural network , the convergence of fast learning is induced by utilizing various normalization layers. However, in a case that is very sensitive to various spatial features of an input image, such as shadow removal, the normalization process causes a problem of losing a large amount of information existing in the input image data. So, we utilize spatially adaptive denormalization(SPADE) to prevent loss of spatial features of input image data. Therefore, not only does it fundamentally solve the problem that various feature information constituting the input image is lost in the normalization process, but also enables precise shadow region removal by combining the feature map of multi-resolutions with the feature map of the decoder. In evaluation, the proposed algorithm shows that it exceeds the existing approach by about 20~30% in both PSNR and RMSE based on the ISTD large data set.
In background subtraction, principal component analysis (PCA) based algorithm has shown remarkable ability to decompose foreground and background in video acquired by static camera. The algorithm via closed form solution of L1-norm Tucker-2 decomposition is one of the real-time background subtraction algorithms. The closed form solution can be obtained from linear combination of video frame vectors and coefficient vector which composed of only +1 and -1. However, since the optimal coefficient vector is unknown, the method cannot help to be a complicated combinatorial optimization problem, when the number of input frame is large. In this paper, to solve this problem, Bayesian optimization (BayesOpt) which is a black-box derivative-free global optimization based background subtraction method is proposed. This method finds the optimal coefficient combination without considering the linear combination of all possible coefficient-combinations, using Bayesian statistical model and Expected Improvement (EI) acquisition function. Here the Bayesian statistical modeling is the method that measures the uncertainty of unsampled coefficient combination points and the EI function is a surrogate function which indicates the next sampling coefficient combination points. The experimental results confirm the efficiency of the proposed method.
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.