We present a novel shadow smoothing algorithm using the bilateral filter. From the observation that shadow leaking, which is found often in filter based approaches, occurs at depth discontinuity seen from the viewpoint of the eye, we apply the bilateral filter which is conceptually a product of two Gaussian filters, one for smoothing the shadow map and the other for handling depth discontinuity...

This paper proposes a new shadow removal approach for input single natural image by using subregion matching illumination transfer. We first propose an effective and automatic shadow detection algorithm incorporating global successive thresholding scheme and local boundary refinement. Then we present a novel shadow removal algorithm by performing illumination transfer on the matched subregion p...

Shadow detection is useful in many applications like image segmentation, scene interpretation and object recognition/tracking. Shadow in images is formed when direct light from a light source cannot reach due to obstruction by an object. Shadow removal is a critical step for improving object detection and tracking. Many algorithms for shadow detection have been proposed in the literature. This ...

The increase in spatial resolution has enabled analysis and detection of images obtained through satellite. To increase the accuracy in image processing, an unwanted shadow needs to be processed effectively. A quality check mechanism governs the false reconstruction problems. In the proposed paper we would like to suggest use of Lib SVM algorithm. The original image obtained from satellite is f...

Spatial search occurs in a connected graph if continuous-time quantum walk on the adjacency matrix of graph, suitably scaled, plus rank-one perturbation induced by any vertex will unitarily map principal eigenvector to characteristic vector vertex. This phenomenon is natural analogue Grover search. The spatial said be optimal it with constant fidelity and time inversely proportional shadow targ...

Recently Chase determined the maximum possible number of cliques size in a graph on vertices with given degree. Soon afterward, Chakraborti and Chen answered version this question which we ask that have edges fixed degree (without imposing any constraint vertices). In paper address these problems hypergraphs. For -graphs issues arise do not appear case. instance, for general can assign degrees ...

HYPOTHESES Task performance improves with the use of a balanced degree of shadow and illumination compared with no or maximum shadow contrast; and overhead shadow-casting illumination is better than side illumination. DESIGN The standard task entailed touching target points on an undulating surface by using a surgical hook. Each run consisted of 13 target points in a random sequence. Five set...

The paper presents a new data structure called a shadow pyramid for storing 3D objects to reduce the shadow-testing time during ray tracing. For each primitive object that first intersects a ray, a shadow pyramid is constructed in which all the candidate objects that possibly block the path from the relevant light source to any point on the primitive object are registered. Shadow testing of. th...

I n the past decades, the effect of different tax amendments on various economic issues has been studied. The majority of these studies have avoided considering shadow economy as part of the calculation and analysis, and an issue, which has received little attention, is the relationship between green tax reforms and shadow economy, as for informal labor, which is well-connected to un...

A user-centric method for fast, interactive, robust, and high-quality shadow removal is presented. Our algorithm can perform detection and removal in a range of difficult cases, such as highly textured and colored shadows. To perform detection, an on-the-fly learning approach is adopted guided by two rough user inputs for the pixels of the shadow and the lit area. After detection, shadow remova...