Image Compression

题目

题目大意:有w*w的棋盘,每个方格为1(黑色)或0(白色),若棋盘的黑色格子数目c1(或白色格子c0)占总格子数的比例>=t;将所有格子都变为黑色(白色),否则,将棋盘均分为四个部分,继续进行上述判断;

思路:简单的dfs;

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int w;
double t;
char a[100][100];
void dfs(int x0,int y0,int len)
{
    int xx[4]={0,0,len/2,len/2};
    int yy[4]={0,len/2,0,len/2};
    int c0=0,c1=0;
    for(int i=x0;i<x0+len;i++)
    {
        for(int j=y0;j<y0+len;j++)
        {
            if(a[i][j]=='0')c0++;
            else c1++;
        }
    }
    if(1.0*c0*100/(c0+c1)>=t)
    {
        for(int i=x0;i<x0+len;i++)//计算概率时不要忘乘100
        {
            for(int j=y0;j<y0+len;j++)a[i][j]='0';
        }
    }
    else if(1.0*c1*100/(c0+c1)>=t)
    {
        for(int i=x0;i<x0+len;i++)
        {
            for(int j=y0;j<y0+len;j++)a[i][j]='1';
        }
    }
    else
    {
        for(int p=0;p<4;p++)
            dfs(x0+xx[p],y0+yy[p],len/2);
    }
   
    return ;
}
int main()
{
    int cn=0;
    while(cin>>w)
    {

        if(w==0)break;
        cin>>t;
        for(int i=0;i<w;i++)
        {
            cin>>a[i];//输入用字符串
        }
        dfs(0,0,w);
        cout<<"Image "<<++cn<<":"<<endl;
        for(int i=0;i<w;i++)
        {
            for(int j=0;j<w;j++)
            {
                cout<<a[i][j];
            }
            cout<<endl;
        }
    }
    return 0;
}

 

ContentsSection I FundamentalsChapter 1 Introduction1.1 Practical Needs for Image and Video Compression1.2 Feasibility of Image and Video Compression1.2.1 Statistical Redundancy1.2.2 Psychovisual Redundancy1.3 Visual Quality Measurement 1.3.1 Subjective Quality Measurement1.3.2 Objective Quality Measurement1.4 Information Theory Results1.4.1 Entropy1.4.2 Shannon’s Noiseless Source Coding Theorem1.4.3 Shannon’s Noisy Channel Coding Theorem1.4.4 Shannon’s Source Coding Theorem1.4.5 Information Transmission Theorem1.5 Summary1.6 ExercisesReferencesChapter 2 Quantization2.1 Quantization and the Source Encoder2.2 Uniform Quantization 2.2.1 Basics2.2.2 Optimum Uniform Quantizer2.3 Nonuniform Quantization2.3.1 Optimum (Nonuniform) Quantization2.3.2 Companding Quantization 2.4 Adaptive Quantization2.4.1 Forward Adaptive Quantization2.4.2 Backward Adaptive Quantization2.4.3 Adaptive Quantization with a One-Word Memory2.4.4 Switched Quantization2.5 PCM2.6 Summary 2.7 ExercisesReferencesChapter 3 Differential Coding3.1 Introduction to DPCM3.1.1 Simple Pixel-to-Pixel DPCM3.1.2 General DPCM Systems3.2 Optimum Linear Prediction(C) 2000 by CRC Press LLC 3.2.1 Formulation3.2.2 Orthogonality Condition and Minimum Mean Square Error3.2.3 Solution to Yule-Walker Equations3.3 Some Issues in the Implementation of DPCM3.3.1 Optimum DPCM System3.3.2 1-D, 2-D, and 3-D DPCM 3.3.3 Order of Predictor3.3.4 Adaptive Prediction3.3.5 Effect of Transmission Errors3.4 Delta Modulation3.5 Interframe Differential Coding 3.5.1 Conditional Replenishment3.5.2 3-D DPCM3.5.3 Motion-Compensated Predictive Coding3.6 Information-Preserving Differential Coding3.7 Summary 3.8 ExercisesReferencesChapter 4 Transform Coding4.1 Introduction4.1.1 Hotelling Transform4.1.2 Statistical Interpretation4.1.3 Geometrical Interpretation4.1.4 Basis Vector Interpretation4.1.5 Procedures of Transform Coding4.2 Linear Transforms4.2.1 2-D Image Transformation Kernel 4.2.2 Basis Image Interpretation4.2.3 Subimage Size Selection4.3 Transforms of Particular Interest4.3.1 Discrete Fourier Transform (DFT)4.3.2 Discrete Walsh Transform (DWT)4.3.3 Discrete Hadamard Transform (DHT)4.3.4 Discrete Cosine Transform (DCT)4.3.5 Performance Comparison4.4 Bit Allocation4.4.1 Zonal Coding4.4.2 Threshold Coding4.5 Some Issues4.5.1 Effect of Transmission Errors4.5.2 Reconstruction Error Sources4.5.3 Comparison Between DPCM and TC 4.5.4 Hybrid Coding4.6 Summary4.7 ExercisesReferencesChapter 5 Variable-Length Coding: Information Theory Results (II)5.1 Some Fundamental Results(C) 2000 by CRC Press LLC 5.1.1 Coding an Information Source5.1.2 Some Desired Characteristics5.1.3 Discrete Memoryless Sources5.1.4 Extensions of a Discrete Memoryless Source5.2 Huffman Codes 5.2.1 Required Rules for Optimum Instantaneous Codes5.2.2 Huffman Coding Algorithm5.3 Modified Huffman Codes 5.3.1 Motivation 5.3.2 Algorithm5.3.3 Codebook Memory Requirement5.3.4 Bounds on Average Codeword Length5.4 Arithmetic Codes 5.4.1 Limitations of Huffman Coding5.4.2 Principle of Arithmetic Coding 5.4.3 Implementation Issues5.4.4 History5.4.5 Applications 5.5 Summary 5.6 ExercisesReferencesChapter 6 Run-Length and Dictionary Coding: Information Theory Results (III)6.1 Markov Source Model 6.1.1 Discrete Markov Source6.1.2 Extensions of a Discrete Markov Source6.1.3 Autoregressive (AR) Model6.2 Run-Length Coding (RLC)6.2.1 1-D Run-Length Coding6.2.2 2-D Run-Length Coding6.2.3 Effect of Transmission Error and Uncompressed Mode6.3 Digital Facsimile Coding Standards6.4 Dictionary Coding6.4.1 Formulation of Dictionary Coding6.4.2 Categorization of Dictionary-Based Coding Techniques6.4.3 Parsing Strategy 6.4.4 Sliding Window (LZ77) Algorithms6.4.5 LZ78 Algorithms6.5 International Standards for Lossless Still Image Compression6.5.1 Lossless Bilevel Still Image Compression6.5.2 Lossless Multilevel Still Image Compression6.6 Summary6.7 ExercisesReferencesSection II Still Image CompressionChapter 7 Still Image Coding Standard: JPEG7.1 Introduction7.2 Sequential DCT-Based Encoding Algorithm(C) 2000 by CRC Press LLC 7.3 Progressive DCT-Based Encoding Algorithm7.4 Lossless Coding Mode7.5 Hierarchical Coding Mode7.6 Summary7.7 ExercisesReferencesChapter 8 Wavelet Transform for Image Coding8.1 Review of the Wavelet Transform8.1.1 Definition and Comparison with Short-Time Fourier Transform8.1.2 Discrete Wavelet Transform8.2 Digital Wavelet Transform for Image Compression8.2.1 Basic Concept of Image Wavelet Transform Coding8.2.2 Embedded Image Wavelet Transform Coding Algorithms8.3 Wavelet Transform for JPEG-20008.3.1 Introduction of JPEG-20008.3.2 Verification Model of JPEG-20008.4 Summary 8.5 ExercisesReferences Chapter 9 Nonstandard Image Coding9.1 Introduction 9.2 Vector Quantization9.2.1 Basic Principle of Vector Quantization9.2.2 Several Image Coding Schemes with Vector Quantization9.2.3 Lattice VQ for Image Coding9.3 Fractal Image Coding9.3.1 Mathematical Foundation9.3.2 IFS-Based Fractal Image Coding9.3.3 Other Fractal Image Coding Methods9.4 Model-Based Coding 9.4.1 Basic Concept9.4.2 Image Modeling 9.5 Summary9.6 ExercisesReferencesSection III Motion Estimation and CompressionChapter 10 Motion Analysis and Motion Compensation10.1 Image Sequences10.2 Interframe Correlation10.3 Frame Replenishment10.4 Motion-Compensated Coding10.5 Motion Analysis10.5.1 Biological Vision Perspective10.5.2 Computer Vision Perspective10.5.3 Signal Processing Perspective(C) 2000 by CRC Press LLC 10.6 Motion Compensation for Image Sequence Processing10.6.1 Motion-Compensated Interpolation 10.6.2 Motion-Compensated Enhancement10.6.3 Motion-Compensated Restoration10.6.4 Motion-Compensated Down-Conversion10.7 Summary 10.8 ExercisesReferencesChapter 11 Block Matching11.1 Nonoverlapped, Equally Spaced, Fixed Size, Small Rectangular Block Matching11.2 Matching Criteria11.3 Searching Procedures11.3.1 Full Search11.3.2 2-D Logarithm Search11.3.3 Coarse-Fine Three-Step Search11.3.4 Conjugate Direction Search11.3.5 Subsampling in the Correlation Window11.3.6 Multiresolution Block Matching11.3.7 Thresholding Multiresolution Block Matching11.4 Matching Accuracy 11.5 Limitations with Block Matching Techniques11.6 New Improvements11.6.1 Hierarchical Block Matching11.6.2 Multigrid Block Matching11.6.3 Predictive Motion Field Segmentation11.6.4 Overlapped Block Matching11.7 Summary 11.8 ExercisesReferencesChapter 12 PEL Recursive Technique12.1 Problem Formulation 12.2 Descent Methods12.2.1 First-Order Necessary Conditions12.2.2 Second-Order Sufficient Conditions 12.2.3 Underlying Strategy12.2.4 Convergence Speed12.2.5 Steepest Descent Method12.2.6 Newton-Raphson’s Method12.2.7 Other Methods12.3 Netravali-Robbins Pel Recursive Algorithm12.3.1 Inclusion of a Neighborhood Area12.3.2 Interpolation12.3.3 Simplification12.3.4 Performance12.4 Other Pel Recursive Algorithms12.4.1 The Bergmann Algorithm (1982)12.4.2 The Bergmann Algorithm (1984)12.4.3 The Cafforio and Rocca Algorithm12.4.4 The Walker and Rao Algorithm(C) 2000 by CRC Press LLC 12.5 Performance Comparison12.6 Summary 12.7 ExercisesReferencesChapter 13 Optical Flow13.1 Fundamentals 13.1.1 2-D Motion and Optical Flow13.1.2 Aperture Problem13.1.3 Ill-Posed Inverse Problem13.1.4 Classification of Optical Flow Techniques13.2 Gradient-Based Approach13.2.1 The Horn and Schunck Method13.2.2 Modified Horn and Schunck Method 13.2.3 The Lucas and Kanade Method13.2.4 The Nagel Method13.2.5 The Uras, Girosi, Verri, and Torre Method 13.3 Correlation-Based Approach13.3.1 The Anandan Method13.3.2 The Singh Method13.3.3 The Pan, Shi, and Shu Method13.4 Multiple Attributes for Conservation Information 13.4.1 The Weng, Ahuja, and Huang Method13.4.2 The Xia and Shi Method13.5 Summary13.6 ExercisesReferencesChapter 14 Further Discussion and Summary on 2-D Motion Estimation14.1 General Characterization14.1.1 Aperture Problem 14.1.2 Ill-Posed Inverse Problem14.1.3 Conservation Information and Neighborhood Information14.1.4 Occlusion and Disocclusion14.1.5 Rigid and Nonrigid Motion14.2 Different Classifications14.2.1 Deterministic Methods vs. Stochastic Methods14.2.2 Spatial Domain Methods vs. Frequency Domain Methods 14.2.3 Region-Based Approaches vs. Gradient-Based Approaches14.2.4 Forward vs. Backward Motion Estimation14.3 Performance Comparison Among Three Major Approaches14.3.1 Three Representatives 14.3.2 Algorithm Parameters14.3.3 Experimental Results and Observations 14.4 New Trends14.4.1 DCT-Based Motion Estimation14.5 Summary14.6 ExercisesReferences(C) 2000 by CRC Press LLC Section IV Video CompressionChapter 15 Fundamentals of Digital Video Coding15.1 Digital Video Representation15.2 Information Theory Results (IV): Rate Distortion Function of Video Signal15.3 Digital Video Formats15.4 Current Status of Digital Video/Image Coding Standards15.5 Summary15.6 ExercisesReferencesChapter 16 Digital Video Coding Standards — MPEG-1/2 Video16.1 Introduction16.2 Features of MPEG-1/2 Video Coding 16.2.1 MPEG-1 Features16.2.2 MPEG-2 Enhancements16.3 MPEG-2 Video Encoding16.3.1 Introduction16.3.2 Preprocessing16.3.3 Motion Estimation and Motion Compensation16.4 Rate Control16.4.1 Introduction of Rate Control16.4.2 Rate Control of Test Model 5 (TM5) for MPEG-216.5 Optimum Mode Decision16.5.1 Problem Formation16.5.2 Procedure for Obtaining the Optimal Mode16.5.3 Practical Solution with New Criteria for the Selection of Coding Mode16.6 Statistical Multiplexing Operations on Multiple Program Encoding16.6.1 Background of Statistical Multiplexing Operation16.6.2 VBR Encoders in StatMux 16.6.3 Research Topics of StatMux16.7 Summary 16.8 ExercisesReferencesChapter 17 Application Issues of MPEG-1/2 Video Coding17.1 Introduction17.2 ATSC DTV Standards17.2.1 A Brief History17.2.2 Technical Overview of ATSC Systems17.3 Transcoding with Bitstream Scaling17.3.1 Background17.3.2 Basic Principles of Bitstream Scaling 17.3.3 Architectures of Bitstream Scaling17.3.4 Analysis 17.4 Down-Conversion Decoder17.4.1 Background17.4.2 Frequency Synthesis Down-Conversion(C) 2000 by CRC Press LLC 17.4.3 Low-Resolution Motion Compensation17.4.4 Three-Layer Scalable Decoder17.4.5 Summary of Down-Conversion Decoder17.4.6 DCT-to-Spatial Transformation17.4.7 Full-Resolution Motion Compensation in Matrix Form 17.5 Error Concealment17.5.1 Background17.5.2 Error Concealment Algorithms17.5.3 Algorithm Enhancements17.5.4 Summary of Error Concealment17.6 Summary17.7 ExercisesReferencesChapter 18 MPEG-4 Video Standard: Content-Based Video Coding18.1 Introduction18.2 MPEG-4 Requirements and Functionalities18.2.1 Content-Based Interactivity18.2.2 Content-Based Efficient Compression18.2.3 Universal Access 18.2.4 Summary of MPEG-4 Features18.3 Technical Description of MPEG-4 Video18.3.1 Overview of MPEG-4 Video18.3.2 Motion Estimation and Compensation 18.3.3 Texture Coding18.3.4 Shape Coding 18.3.5 Sprite Coding18.3.6 Interlaced Video Coding18.3.7 Wavelet-Based Texture Coding18.3.8 Generalized Spatial and Temporal Scalability18.3.9 Error Resilience18.4 MPEG-4 Visual Bitstream Syntax and Semantics 18.5 MPEG-4 Video Verification Model18.5.1 VOP-Based Encoding and Decoding Process18.5.2 Video Encoder18.5.3 Video Decoder18.6 Summary 18.7 ExercisesReferenceChapter 19 ITU-T Video Coding Standards H.261 and H.26319.1 Introduction19.2 H.261 Video-Coding Standard19.2.1 Overview of H.261 Video-Coding Standard19.2.2 Technical Detail of H.26119.2.3 Syntax Description19.3 H.263 Video-Coding Standard19.3.1 Overview of H.263 Video Coding19.3.2 Technical Features of H.26319.4 H.263 Video-Coding Standard Version 2(C) 2000 by CRC Press LLC 19.4.1 Overview of H.263 Version 2 19.4.2 New Features of H.263 Version 219.5 H.263++ Video Coding and H.26L19.6 Summary19.7 ExercisesReferencesChapter 20 MPEG System — Video, Audio, and Data Multiplexing20.1 Introduction 20.2 MPEG-2 System 20.2.1 Major Technical Definitions in MPEG-2 System Document20.2.2 Transport Streams20.2.3 Transport Stream Splicing20.2.4 Program Streams20.2.5 Timing Model and Synchronization 20.3 MPEG-4 System20.3.1 Overview and Architecture20.3.2 Systems Decoder Model20.3.3 Scene Description20.3.4 Object Description Framework20.4 Summary20.5 ExercisesReferences
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值