Graph-theoretical analysis of the fractal transform

Domaszewicz, J.; Vaishampayan, Vinay A.

doi:10.1109/icassp.1995.480071

Cited by 15 publications

(15 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Domaszewicz and Vaishampayan (1995) introduced the notion of a dependence graph. The graph reflects how domain blocks are assigned to range blocks.…”

Section: Existing Fractal Recognition Methods With Divisionmentioning

confidence: 99%

“…Moreover, we introduce a new fractal recognition method which will be used in the recognition of 2D shapes. As fractal features we used a dependence graph (Domaszewicz and Vaishampayan, 1995) achieved from a Partitioned Iterated Function System (PIFS) (Fisher, 1995).…”

Section: Introductionmentioning

confidence: 99%

“…Then, in Section 5 we present how to modify the existing fractal recognition methods using the PIFS with division. In Section 6 we present the definition of the dependence graph (Domaszewicz and Vaishampayan, 1995) and our fractal recognition method of 2D shapes which uses the dependence graph for recognition. The effectiveness of our method is shown on two test databases (Section 7).…”

mentioning

confidence: 99%

See 2 more Smart Citations

Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

Gdawiec

Domańska

2011

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

One of the approaches in pattern recognition is the use of fractal geometry. The property of self-similarity of fractals has been used as a feature in several pattern recognition methods. All fractal recognition methods use global analysis of the shape. In this paper we present some drawbacks of these methods and propose fractal local analysis using partitioned iterated function systems with division. Moreover, we introduce a new fractal recognition method based on a dependence graph obtained from the partitioned iterated function system. The proposed method uses local analysis of the shape, which improves the recognition rate. The effectiveness of our method is shown on two test databases. The first one was created by the authors and the second one is the MPEG7 CE-Shape-1PartB database. The obtained results show that the proposed methodology has led to a significant improvement in the recognition rate.

show abstract

“…Domaszewicz and Vaishampayan (1995) introduced the notion of a dependence graph. The graph reflects how domain blocks are assigned to range blocks.…”

Section: Existing Fractal Recognition Methods With Divisionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

Gdawiec

Domańska

2011

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…Of these measures, the most important one exploits the dependence graph [18] of the fractal code for a fast computation of the cost function.…”

Section: Introductionmentioning

confidence: 99%

Distortion Minimization with Fast Local Search for Fractal Image Compression

Hamzaoui¹,

Saupe²,

Hiller³

2001

Journal of Visual Communication and Image Representation

View full text Add to dashboard Cite

“…The adaptive partition [68] and the hybrid compression algorithm exhibit, relatively, the high compression ratio for image [68] and the video conference sequences [67]. In conclusion, a fractal image codec performs better in terms of very fast decoding process as well as the promise of potentially good compression [69][70][71][72][73]. But at present, the fractal codec is not standardized because of its huge calculation amount and slow coding speed.…”

Section: Related Work On Motion Estimationmentioning

confidence: 99%

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

Kamble¹,

Thakur²,

Bajaj³

2016

IJIMAI

View full text Add to dashboard Cite

---Fractal compression is the lossy compression technique in the field of gray/color image and video compression. It gives high compression ratio, better image quality with fast decoding time but improvement in encoding time is a challenge. This review paper/article presents the analysis of most significant existing approaches in the field of fractal based gray/color images and video compression, different block matching motion estimation approaches for finding out the motion vectors in a frame based on inter-frame coding and intra-frame coding i.e. individual frame coding and automata theory based coding approaches to represent an image/sequence of images. Though different review papers exist related to fractal coding, this paper is different in many sense. One can develop the new shape pattern for motion estimation and modify the existing block matching motion estimation with automata coding to explore the fractal compression technique with specific focus on reducing the encoding time and achieving better image/video reconstruction quality. This paper is useful for the beginners in the domain of video compression.

show abstract

Graph-theoretical analysis of the fractal transform

Cited by 15 publications

References 4 publications

Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

Distortion Minimization with Fast Local Search for Fractal Image Compression

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

Contact Info

Product

Resources

About