{"title":"Enhanced-IPMH as a Robust Visual Descriptor from H.264/AVC and Evaluation of Parameters Effects","authors":"A. Rouhi","doi":"10.1109/DICTA.2015.7371254","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371254","url":null,"abstract":"Intra-prediction Modes-based (IPM-based) descriptors are among robust and competitive visual descriptors for near-duplicate video similarity detection, in general and content-based copy detection (CCD), in particular. IPM-based descriptors are extracted from the compressed H.264/AVC (MPEG-4/AVC) video domain. Intra-prediction Modes (IPM) are the building blocks of the key frames (I and IDR slices) in the H.264/AVC video standard. IPM-based descriptors are generally constructed based on the probability distribution of the unified intra-prediction modes of the key frames. The current research introduce an enhanced version of IPM-Histogram (IPMH) with 10 bins, which is called enhanced-IPMH (e-IPMH). This research conducted using a subset of TRECVID/CCD (2011), dataset and TREC-EVAL-Video software to compute the performance measures. Based on the experimental evidences, the e-IPMH is an effective and inexpensive visual feature, compared to the pixel domain global descriptors. Analysing the experimental results of the e-IPMH, compared to its predecessor, IPMH shows improvement in the performance measures: Mean Reciprocal Rank (MRR) and Precision@1. However, its mean processing time, reveals it is slower compared to IPMH, due to its larger descriptor size. The current research also conducted a series of experiments to evaluate the effect of spatio-temporal parameters on IPM-based descriptors. The scope of the experiments are limited to the content-preserving visual distortions: T3, T4, T5 and T6 which are the functional scope of global visual descriptors.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122791637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Automatic Algorithm for Tracking Small Intestine in CT Enterography","authors":"J. Horáček, M. Horák, J. Kolomazník, J. Pelikán","doi":"10.1109/DICTA.2015.7371228","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371228","url":null,"abstract":"In this paper we present an automatic algorithm to segment and track small intestine from CT enterography. The algorithm can handle noisy thin-slice data and is adaptable to the greatly varying spatial structure of the organ. Our approach automatically segments all well-distended parts and performs tracking of the intestinal path. Pre-filtered data are segmented with watershed segmentation and then a kNN-based probability function enhances whole parts of the lumen. Post-process based on a robust form of region growing is then used for path tracking.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129500625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Unsupervised Processing of Vehicle Appearance for Automatic Understanding in Traffic Surveillance","authors":"Jakub Sochor, A. Herout","doi":"10.1109/DICTA.2015.7371318","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371318","url":null,"abstract":"This paper deals with unsupervised collection of information from traffic surveillance video streams. Deployment of usable traffic surveillance systems requires minimizing of efforts per installed camera - our goal is to enroll a new view on the street without any human operator input. We propose a method of automatically collecting vehicle samples from surveillance cameras, analyze their appearance and fully automatically collect a fine-grained dataset. This dataset can be used in multiple ways, we are explicitly showcasing the following ones: fine-grained recognition of vehicles and camera calibration including the scale. The experiments show that based on the automatically collected data, make&model vehicle recognition in the wild can be done accurately: average precision 0.890. The camera scale calibration (directly enabling automatic speed and size measurement) is twice as precise as the previous existing method. Our work leads to automatic collection of traffic statistics without the costly need for manual calibration or make&model annotation of vehicle samples. Unlike most previous approaches, our method is not limited to a small range of viewpoints (such as eye-level cameras shots), which is crucial for surveillance applications.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114313742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hrishikesh Sharma, Adithya Vellaiappan, Tanima Dutta, P. Balamuralidhar
{"title":"Image Analysis-Based Automatic Utility Pole Detection for Remote Surveillance","authors":"Hrishikesh Sharma, Adithya Vellaiappan, Tanima Dutta, P. Balamuralidhar","doi":"10.1109/DICTA.2015.7371267","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371267","url":null,"abstract":"In case of disasters such as cyclones, earthquakes, severe floods etc., widespread damages to infrastructures such as power grid, communication infrastructure etc. is commonplace. Especially to power grid, the damages to various structures are typically spread out in wide areas. Usage of drones to do fast remote survey of damage area is gaining popularity. From the remote surveillance video of any wide disaster area that is fairly long, it is important to extract keyframes that contain specific component structures of the power grid. The keyframes can then be analyzed for possible damage to the specific structure. In this context, we present an algorithm for automated detection of utility poles. Specifically, we show robust detection of poles in frames of videos available from various sources. The detection is performed by first extracting 2D shapes of poles as analytically defined geometric shape, quadrilateral, whose edges exhibit noise corruption. A pole is then detected as a shape-based template, where one long rectangular trapezium, is perpendicularly intersected by at least one trapezium representing a crossarm that suspends the conductors. Via testing and comparison, our algorithm is shown to be more robust as compared to other approaches, especially against highly variable background. We believe such detection, with limited false negatives, will form stepping stone towards future detection of damages in utility poles.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121741174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Skin Hair Removal for 2D Psoriasis Images","authors":"Y. George, M. Aldeen, R. Garnavi","doi":"10.1109/DICTA.2015.7371308","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371308","url":null,"abstract":"Presence of hair in psoriasis skin images may adversely affect the extraction of the features required for computer aided analysis, thus compromise the detection and diagnostic results. Therefore, for the diagnosis of psoriasis to be accurate, it is vitally important to remove hair, if it exists, from images in the preprocessing stage. This paper presents, for the first time, a hair detection and removal algorithm for 2D psoriasis images. The hair removal process starts with a markers removal algorithm, where the shape features are extracted from the binary input image. The outcome of this step is removal of all objects that obscure the image lesions such that the output image contains psoriasis lesions and normal skin only. Next, the dark hair in the skin is identified using contrast enhancement method and morphological operations. Finally, image interpolation is performed to replace the hair pixels with hair free neighbouring pixels values through image inpainting. The proposed algorithm is tested on 64 psoriasis images acquired from the Royal Melbourne Hospital, Victoria, Australia. Experimental results demonstrate that the algorithm is highly accurate and effective. In addition, the widely used hair removal software DullRazor® is used on the same 64 images for comparison. The results show that our proposed algorithm performs quite well and is more adapt to psoriasis images. The method is more effective because it overcomes the problem of removing skin hair without affecting the intensity or texture features of the lesions.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127414558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Monocular Human Motion Tracking with Non-Connected Body Part Dependency","authors":"Jinglan Tian, Ling Li, Wanquan Liu","doi":"10.1109/DICTA.2015.7371283","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371283","url":null,"abstract":"2D articulated human pose tracking in monocular image sequences remains an extremely challenging task due to background cluttering, variation in body appearance, occlusion and imaging conditions. Most of the current approaches only deal with simple appearance and adjacent or connected body part dependencies, especially the tree-structured priors assumed over body part connections. Such prior excludes the dependencies between non-connected body parts which could actually contribute to tracking accuracies. Building on the successful pictorial structures model, we propose a novel framework for human pose tracking including more dependencies of non-connected body parts. In order to implement inference efficiently for the proposed model, we introduce a factor graph to factorize all the unary term and all dependencies that are modelled in the pairwise term of the proposed model. In this paper, we also observe that the posterior marginals of each part from the tree structure model satisfy a Gaussian distribution. Based on this property, the sampling procedure becomes straight-forward and the search space can be shrunk effectively. We incorporate a simple motion constraint to capture the temporal continuity of body parts between frames, since the positions/orientations of body parts usually change smoothly between consecutive frames. In addition, we introduce a full body detector as the first step of our framework to reduce the search space for pose tracking. We also exploit the temporal continuity of body parts between frames by incorporating constraints on the location distance and the orientation difference for each body part between two successive frames. We evaluate our framework on two challenging image sequences and conduct a series of experiments to compare the performance with the approaches based on the tree-based model. The results illustrate that the proposed framework improves the performance significantly.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117031697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-Local Noise Estimation for Adaptive Image Denoising","authors":"M. Hanif, A. Seghouane","doi":"10.1109/DICTA.2015.7371290","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371290","url":null,"abstract":"Image denoising is a classical linear inverse problem with applications in remote sensing, medical imaging, astronomy and surveillance. This article addresses the image denoising problem using a non-local noise estimation based on the spatial redundancy offered by natural images. A low dimensional signal subspace is estimated using the statistical strength of singular value decomposition (SVD), which reduces the computational burden and enhances the local basis screening. A multiple regression based approach is then applied on the estimated basis to calculate the observation noise and the whole image is restored by patch based processing. The proposed method is adaptive in the sense that all the algorithm parameters are learned from the observed noisy data. The simulated comparisons shows comparatively high performance of the proposed algorithm comparing to the other image denoising techniques.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116998347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Robin Huang, Lei Bi, Changyang Li, Younhyun Jung, Jinman Kim, M. Fulham, D. Feng
{"title":"A Locally Constrained Random Walk Approach for Airway Segmentation of Low-Contrast Computed Tomography (CT) Image","authors":"Robin Huang, Lei Bi, Changyang Li, Younhyun Jung, Jinman Kim, M. Fulham, D. Feng","doi":"10.1109/DICTA.2015.7371216","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371216","url":null,"abstract":"Positron emission tomography (PET) combined with computed tomography (CT) is a routine imaging modality for the diagnosis and interpretation of malignant diseases of the thorax. Accurate airway segmentation is critical for the localization of sites of abnormal metabolism detected with PET-CT. The vast majority of published segmentation algorithms, however, are designed for high- resolution CT and these algorithms do not perform well with the low-contrast CT acquired in PET-CT images. In this study, we present a new fully automated airway segmentation algorithm that is optimised to tolerate the image characteristics inherent in low-contrast CT images. Our algorithm accurately and robustly segments the airway by introducing: (i) a robust multi-atlas initialisation which incorporates shape priori knowledge for seeds derivation; and (ii) a modified knowledge-based random walk segmentation that uses the derived seeds and manipulates the weights of the edge paths in a locally constrained search space. Our proposed algorithm was evaluated on 20 clinical low-contrast CT from PET-CT patient studies and demonstrated better performance in segmentation results against comparative state-of- the-art algorithms.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124071798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of Gaussian and Box Kernel Based Approximation of Bilateral Filter Using OpenCL","authors":"Honey Gupta, Daniel Sanju Antony, N. RathnaG.","doi":"10.1109/DICTA.2015.7371269","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371269","url":null,"abstract":"A Bilateral filter is basically an edge-preserving and smoothing, non-linear filter. It consists of two kernels, namely spatial and range kernels which can be constant or arbitrary. Algorithms for bilateral filtering with constant time computational complexity are present today, but their execution time is too high for real time applications. Also, hardware latency and throughput sometimes reduce the speed of filtering. In this paper, we introduce a novel algorithm for bilateral filtering in which we combine box spatial kernel with Gauss-Polynomial range kernel. Parallel implementation of the algorithm is done on GPU (AMD Radeon HD 7650M) using OpenCL and an average run time of 15ms is achieved for an image of dimensions 256 x 256. Results of this algorithm is found to be about 15 times faster than the parallel implementation of bilateral filter with Gaussian spatial kernel and Gauss-Polynomial range kernel. We infer that while the PSNR values obtained are very close, there is a significant improvement in run-time when we use the proposed algorithm.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125747429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Model Integrating Fire Prediction and Detection for Rural-Urban Interface","authors":"N. Alamgir, W. Boles, V. Chandran","doi":"10.1109/DICTA.2015.7371217","DOIUrl":"https://doi.org/10.1109/DICTA.2015.7371217","url":null,"abstract":"This paper proposes a model that integrates new smoke detection and fire prediction techniques for the rural-urban interface area. The model aims to predict fire risk from weather parameters, and to detect smoke using video monitoring systems. Further, the fire danger index (FDI) provided by the prediction algorithm would be utilized to enhance the certainty of smoke detection and reduce false alarm rates. Experimental results illustrate that our prediction algorithm successfully predicts fire risk on a five-point scale with mean accuracy of 94.92% and the detection algorithm more effectively detects smoke compared to other algorithms by achieving 97% average accuracy.","PeriodicalId":214897,"journal":{"name":"2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}