A great number of methods based on local features or global appearances have been proposed in the literature for geospatial object detection and recognition from satellite images. However, since these approaches do not have enough discriminative capabilities between object and non-object classes, they produce results with innumerable false positives during their detection process. Moreover, due to the sliding window mechanisms, these algorithms cannot yield exact location information for the detected objects. Therefore, a geospatial object recognition algorithm based on the object shape mask is proposed to minimize the aforementioned imperfections. In order to develop such a robust recognition system, foreground extraction performance of some of popular fully and semi-automatic image segmentation algorithms, such as normalized cut, k-means clustering, mean-shift for fully automatic, and interactive Graph-cut, GrowCut, GrabCut for semi-automatic, are evaluated in terms of their subjective and objective qualities. After this evaluation, the retrieval performance of some shape description techniques, such as ART, Hu moments and Fourier descriptors, are investigated quantitatively. In the proposed system, first of all, some hypothesis points are generated for a given test image. Then, the foreground extraction operation is achieved via GrabCut algorithm after utilizing these hypothesis points as if these are user inputs. Next, the extracted binary object masks are described by means of the integrated versions of shape description techniques. Afterwards, SVM classifier is used to identify the target objects. Finally, elimination of the multiple detections coming from the generation of hypothesis points is performed by some simple post-processing on the resultant masks. Experimental results reveal that the proposed algorithm has promising results in terms of accuracy in recognizing many geospatial objects, such as airplane and ship, from high resolution satellite imagery.

This thesis proposes a new chroma keying method that can automatically detect background, foreground, and unknown regions. For background color detection, we use K-means clustering in color space to calculate the limited number of clusters of background colors. We use spatial information to clean the background regions and minimize the unknown regions. Our method only needs minimum inputs from user. For unknown regions, we implement the alpha matte based on Wang's robust matting algorithm, which is considered one of the best algorithms in the literature, if not the best. Wang's algorithm is based on modified random walk. We proposed a better color selection method, which improves matting results in the experiments. In the thesis, a detailed implementation of robust matting is provided. The experimental results demonstrate that our proposed method can handle images with one background color, images with gridded background, and images with difficult regions such as complex hair stripes and semi-transparent clothes.

This thesis proposes a new chroma keying method that can automatically detect background, foreground, and unknown regions. For background color detection, we use K-means clustering in color space to calculate the limited number of clusters of background colors. We use spatial information to clean the background regions and minimize the unknown regions. Our method only needs minimum inputs from user. For unknown regions, we implement the alpha matte based on Wang's robust matting algorithm, which is considered one of the best algorithms in the literature, if not the best. Wang's algorithm is based on modified random walk. We proposed a better color selection method, which improves matting results in the experiments. In the thesis, a detailed implementation of robust matting is provided. The experimental results demonstrate that our proposed method can handle images with one background color, images with gridded background, and images with difficult regions such as complex hair stripes and semi-transparent clothes.

This thesis proposes a new chroma keying method that can automatically detect background, foreground, and unknown regions. For background color detection, we use K-means clustering in color space to calculate the limited number of clusters of background colors. We use spatial information to clean the background regions and minimize the unknown regions. Our method only needs minimum inputs from user. For unknown regions, we implement the alpha matte based on Wang's robust matting algorithm, which is considered one of the best algorithms in the literature, if not the best. Wang's algorithm is based on modified random walk. We proposed a better color selection method, which improves matting results in the experiments. In the thesis, a detailed implementation of robust matting is provided. The experimental results demonstrate that our proposed method can handle images with one background color, images with gridded background, and images with difficult regions such as complex hair stripes and semi-transparent clothes.

This thesis proposes a new chroma keying method that can automatically detect background, foreground, and unknown regions. For background color detection, we use K-means clustering in color space to calculate the limited number of clusters of background colors. We use spatial information to clean the background regions and minimize the unknown regions. Our method only needs minimum inputs from user. For unknown regions, we implement the alpha matte based on Wang's robust matting algorithm, which is considered one of the best algorithms in the literature, if not the best. Wang's algorithm is based on modified random walk. We proposed a better color selection method, which improves matting results in the experiments. In the thesis, a detailed implementation of robust matting is provided. The experimental results demonstrate that our proposed method can handle images with one background color, images with gridded background, and images with difficult regions such as complex hair stripes and semi-transparent clothes.

This thesis deals with the problem of foreground extraction on mobile devices. The main goal of this project is to find or design segmentation methods for separating a user-selected object from an image (or video). The main requirement of these methods is the image processing time and segmentation quality. Some existing solutions of this problem are mentioned and their usability on mobile devices is discussed. A mobile application is created within the project, demonstrating the implemented real time foreground extraction algorithm.

In this master thesis, object's detection in image and tracking these objects in temporal area will be presented. First, theoretical background of the image's preprocessing, image filtration, the foreground extraction, and many others various image's features will be described. Next, design and implementation of detector will be processed. This part of my master thesis containes mainly information about detection of objects on belt conveyer Finally,results, conclusion and many supplementary data such as a photography camera's location will be shown.