Ferdous A. Sohel, Prof. Laurence S. Dooley and Dr. Gour C. Karmakar Gippsland School of Computing and Information System Monash University, Churchill.

Slides:



Advertisements
Similar presentations
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
Advertisements

Viewing & Clipping In 2D. 2 of 44 Contents Windowing Concepts Clipping –Introduction –Brute Force –Cohen-Sutherland Clipping Algorithm Area Clipping –Sutherland-Hodgman.
Arbitrary Bit Generation and Correction Technique for Encoding QC-LDPC Codes with Dual-Diagonal Parity Structure Chanho Yoon, Eunyoung Choi, Minho Cheong.
Ahmed Awad Atsushi Takahash Satoshi Tanakay Chikaaki Kodamay ICCAD’14
Rate-Distortion Optimal Skeleton-Based Shape Coding Haohong Wang, Aggelos K. Katsaggelos, and Thrasyvoulos N. Pappas Image Processing, Proceedings.
Robust video fingerprinting system Daniel Luis
A Multicamera Setup for Generating Stereo Panoramic Video Tzavidas, S., Katsaggelos, A.K. Multimedia, IEEE Transactions on Volume: 7, Issue:5 Publication.
A Quality-Driven Decision Engine for Live Video Transmission under Service-Oriented Architecture DALEI WU, SONG CI, HAIYAN LUO, UNIVERSITY OF NEBRASKA-LINCOLN.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Efficient Moving Object Segmentation Algorithm Using Background Registration Technique Shao-Yi Chien, Shyh-Yih Ma, and Liang-Gee Chen, Fellow, IEEE Hsin-Hua.
ACM Multimedia th Annual Conference, October , 2004
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Motion-compensation Fine-Granular-Scalability (MC-FGS) for wireless multimedia M. van der Schaar, H. Radha Proceedings of IEEE Symposium on Multimedia.
Automatic Key Video Object Plane Selection Using the Shape Information in the MPEG-4 Compressed Domain Berna Erol and Faouzi Kossentini, Senior Member,
A Generic Shape Descriptor using Bezier Curves Presenting by – Dr. Manzur Murshed Authors – Ferdous Ahmed Sohel Dr. Gour C. Karmakar Prof. Laurence S.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Dynamic View-Dependent Simplification for Polygonal.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Using Relevance Feedback in Multimedia Databases
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
1 University of Denver Department of Mathematics Department of Computer Science.
Genetically optimized face image CAPTCHA
Low power and cost effective VLSI design for an MP3 audio decoder using an optimized synthesis- subband approach T.-H. Tsai and Y.-C. Yang Department of.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Presenting by, Prashanth B R 1AR08CS035 Dept.Of CSE. AIeMS-Bidadi. Sketch4Match – Content-based Image Retrieval System Using Sketches Under the Guidance.
Seok-Won Seong and Prabhat Mishra University of Florida IEEE Transaction on Computer Aided Design of Intigrated Systems April 2008, Vol 27, No. 4 Rahul.
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
Introduction Due to the recent advances in smart grid as well as the increasing dissemination of smart meters, the electricity usage of every moment in.
CLASSIFYING QUADRILATERALS DAY 2. Bellwork  Please begin working on P 293 (60-63)
Globally Optimal Grouping for Symmetric Closed Boundaries with Stahl/ Wang Method Vida Movahedi September 2007.
1 Faculty of Information Technology Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info.
© Manfred Huber Autonomous Robots Robot Path Planning.
An Improved Shape Descriptor Using Bezier Curves Authors: Ferdous Ahmed Sohel Dr. Gour Chandra Karmakar Professor Laurence Sean Dooley.
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
RANI NALAMARU DEPARTMENT OF COMPUTER SCIENCE BALL STATE UNIVERSITY RANI NALAMARU DEPARTMENT OF COMPUTER SCIENCE BALL STATE UNIVERSITY Efficient Transmission.
Shape Based Image Retrieval Using Fourier Descriptors Dengsheng Zhang and Guojun Lu Gippsland School of Computing and Information Technology Monash University.
1 n 1 n 1 1 n n Schema for part of a business application relational database.
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements I-Hong Hou and P.R. Kumar 1.
FAST DYNAMIC QUANTIZATION ALGORITHM FOR VECTOR MAP COMPRESSION Minjie Chen, Mantao Xu and Pasi Fränti University of Eastern Finland.
Shape-based Similarity Query for Trajectory of Mobile Object NTT Communication Science Laboratories, NTT Corporation, JAPAN. Yutaka Yanagisawa Jun-ichi.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
A Segmentation Algorithm Using Dyadic Wavelet Transform and the Discrete Dynamic Contour Bernard Chiu University of Waterloo.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
Zhuo Peng, Chaokun Wang, Lu Han, Jingchao Hao and Yiyuan Ba Proceedings of the Third International Conference on Emerging Databases, Incheon, Korea (August.
Wireless communications and mobile computing conference, p.p , July 2011.
1 Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations J. Xu and D. L. Parnas IEEE Transactions on Software Engineering,
Clustering of Uncertain data objects by Voronoi- diagram-based approach Speaker: Chan Kai Fong, Paul Dept of CS, HKU.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.
The Maximum Traveling Salesman Problem under Polyhedral Norms Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger and Russell Woodroffe Integer.
1 Approximate XML Query Answers Presenter: Hongyu Guo Authors: N. polyzotis, M. Garofalakis, Y. Ioannidis.
SOFTWARE TESTING. Introduction Software Testing is the process of executing a program or system with the intent of finding errors. It involves any activity.
Graph Data Management Lab, School of Computer Science Branch Code: A Labeling Scheme for Efficient Query Answering on Tree
Objective: To find the opposite and the absolute value of an integer.
Digital Image Processing CSC331
1 Faculty of Information Technology Enhanced Generic Fourier Descriptor for Object-Based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
SIMD Implementation of Discrete Wavelet Transform Jake Adriaens Diana Palsetia.
AS Decision Maths Tips for each Topic. Kruskal and Prim What examiner’s are looking for A table of values in the order that they are added and the total.
Acknowledgments: The study is funded by the Deep-C consortium and a grant from BOEM. Model experiments were performed at the Navy DoD HPC, NRL SSC and.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Prof. Yu-Chee Tseng Department of Computer Science
A review of audio fingerprinting (Cano et al. 2005)
Estimation of 3D Bounding Box for Image Object
Finding Heuristics Using Abstraction
Improving Retrieval Performance of Zernike Moment Descriptor on Affined Shapes Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info Tech Monash.
Author(s). TITLE, Journal, vol. #, pp.#-#, Month, Year.
Dr. Zhijie Huang and Prof. Hong Jiang University of Texas at Arlington
Alan Kuhnle*, Victoria G. Crawford, and My T. Thai
A Block Based MAP Segmentation for Image Compression
Presentation transcript:

Ferdous A. Sohel, Prof. Laurence S. Dooley and Dr. Gour C. Karmakar Gippsland School of Computing and Information System Monash University, Churchill. Victoria 3842 Contact address Reference: [1]. A.K. Katsaggelos, L.P. Kondi, F.W. Meier, J. Ostermann, and G.M. Schuster, “MPEG-4 and Rate-Distortion-Based Shape-Coding Techniques,” Proceedings of IEEE, vol. 86, pp , June Shape Codec Which one is BETTER ? QUALITY A D B G H K BK BA WHAT IS THE MINIMUM DISTANCE OF POINT B FROM LINE AD ?? So The SHORTEST ABSOLUTE DISTANCE alone cannot do ALL What is the distortion at the corners ?? 1 pel 3.1 pel !!! Region 3 Region 2 Region 1 F E A D BC P Q s r Step 1  If the shape point is in region 1 (opposite side of the perpendicular lines) use the shortest absolute distance as the distortion metric, d (A, D, Shape_point).  Else if it is in region 2 same side of the perpendicular lines and close to End point A use the direct Euclidean distortion measure d (A, Shape_point). EQ: (2).  Else use the direct Euclidean distortion measure d (D, Shape_point). EQ: (2). (1) (2) Step 2 Object Shape (class one) (pel) ORD-ADMSC (distortion)ORD-original (distortion) Class one (pel)Class two (pel 2 )Class one (pel)Class two (pel 2 ) Miss America (Neck) Miss America (Lip) Fish Fish Butterfly Butterfly Synthetic Synthetic Given maximum distortion = 1 pel [1]- D_max=1.4pelDMSC- D_max=1 pel [1]- D_max=10 pel DMSC-D_mx=1 pel Given D_max = 3 pel [1]- D_max >3pel DMSC- D_max=3 pel [1]- D_max=4.5 pel DMSC- D_max=2 pel Given D_max = 2 pel Results Abstract Efficient encoding of object boundaries has become increasingly prominent in areas such as content-based storage and retrieval, studio and television post- production facilities, mobile communications and other real-time multimedia applications. The way distortion between the actual and approximated shapes is measured however, has a major impact upon the quality of the shape coding algorithms. In existing shape coding methods, the distortion measure do not generate an actual distortion value, so this paper proposes a new distortion measure, called a modified distortion measure for shape coding (DMSC) which incorporates an actual perceptual distance. The performance of the Operational Rate Distortion optimal algorithm [1] incorporating DMSC has been empirically evaluated upon a number of different natural and synthetic arbitrary shapes. Both qualitative and quantitative results confirm the superior results in comparison with the ORD algorithm for all test shapes, without any increase in computational complexity. Challenges:  Measure the actual distance of a particular point from an edge.  Hence, measure the accurate distortion at that particular shape point while approximating the shape using polygons. Motivation:  Operational-Rate-Distortion based Shape coding is a challenging task.  A correct distortion metric is important to ensure the quality of the encoding system.  The existing ORD shape coding algorithms (e.g., [1]) use the shortest absolute distance as the distortion metric. It cannot always calculate the distortion correctly specially, for the shapes having sharp corners. Conclusions: Accurately calculate the distortion. Can be seamlessly integrated into the ORD algorithms [1]. Makes guarantee on the distortion measurements. Has the same computational complexity order of the Shortest absolute distance metric. How DMSC Works: Step 1: Find the Position of the shape point with respect to the approximating polygon. - Draw perpendicular lines through the end-points of the approximating line. - Determine the region where the shape point belongs to. Step 2: Measure the distance in accordance with the region (position of the shape). Step 3: Use this distortion hence forth in the ORD algorithms [1].