aprilcuhk-CSDN博客

原创 Flutter ListView UI异常

一个是正常的ListView，另外一个是带分割线的listview为什么正常的listview，body99那里没有展示完整？？？代码如下 @override Widget build(BuildContext context) { // This method is rerun every time setState is called, for in...

2019-09-27 11:12:54 386

原创 RePlugin的demo-菜鸟入门跑起来版

新建一个项目1、项目的build.gradle中增加①如果gradle版本是3.2.0+，要改成3.1.4，否则会掉进很大的坑（亲测）②增加 classpath 'com.qihoo360.replugin:replugin-host-gradle:2.3.1'2、在项目最下面的settings.gradle中增加插件原来是只有app的，增加这一行include ':...

2019-06-18 15:03:34 646

原创第一行代码-第四章BroadcastReceiver-（1）

package com.example.huiqian.myapplication;import android.content.BroadcastReceiver;import android.content.Context;import android.content.Intent;import android.content.IntentFilter;import androi...

2018-12-05 11:44:06 221

原创第一行代码碰到的问题-default activity not fond

在第二章intent这里写完xml后报错出现，default activity not fond检查了AndroidManifest很多次，确认没有问题点击run左边的app下面的edit configurationslaunch options那里选Nothing重新run这个项目就ok了...

2018-12-03 14:27:23 274

原创第一行代码-常见控件的使用demo1

activity_main.xml<?xml version="1.0" encoding="utf-8"?><LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" xmlns:app="http://schemas.android.com/apk/res-auto" ...

2018-11-30 11:10:54 140

原创第一行代码-RecyclerViewDemo(1)-实现横向滚动

activity_main.xml<?xml version="1.0" encoding="utf-8"?><LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" xmlns:app="http://schemas.android.com/apk/res-auto" ...

2018-11-28 11:53:05 303

原创第一行代码-ListViewDemo(3)

点击事件，对应120页MainActivity.javaimport android.support.v7.app.AppCompatActivity;import android.os.Bundle;import android.view.View;import android.widget.AdapterView;import android.widget.ArrayAdap...

2018-11-28 10:48:42 231

原创第一行代码-ListViewDemo（2）-读书笔记

对应第一行代码的114页activity_main.xml<?xml version="1.0" encoding="utf-8"?><LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"android:orientation="vertical"android:layout...

2018-11-28 10:23:21 131

原创第一行代码-ListViewDemo(1)

activity_main.xml构造：<?xml version="1.0" encoding="utf-8"?><LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"android:orientation="vertical"android:layout_width="ma

2018-11-27 20:23:55 217

原创构建第一个LuaView应用

1、从GitHub克隆最新版本的LuaViewSDK到本地。- github网址: https://github.com/alibaba/LuaViewSDK- https方式：git clone https://github.com/alibaba/LuaViewSDK.git- ssh方式：git clone [email protected]:alibaba/LuaViewSDK.g...

2018-11-18 13:55:31 497

原创剑指offer所有题目java版

//面试题1：赋值运算符函数/** * 赋值运算符函数 * 1.对于传入的参数，不应该被修改，使用final修饰； * 2.如果两个对象相同或值相等，不进行操作，直接返回； * 3.返回值最好为this，这样可以使赋值链接起来。 * 一个缺点：此赋值从左到右进行，a=b=c等价于a=c，b不会被赋值； * 而如果是String的=运算，a,b都会被赋成c的值。 */public...

2018-10-03 18:28:48 346

原创剑指Offer-平衡二叉树

题目描述输入一棵二叉树，判断该二叉树是否是平衡二叉树。public class Solution { public boolean IsBalanced_Solution(TreeNode root) { return getDepth(root) != -1; } private int getDepth(TreeNode root) {...

2018-09-16 14:47:04 122

原创剑指Offer-二进制中1的个数

题目描述输入一个整数，输出该数二进制表示中1的个数。其中负数用补码表示。public class Solution { public int NumberOf1(int n) { int count=0; while(n!=0){ ++count; n=(n-1)&n; } ...

2018-09-16 14:36:13 68

题目描述HZ偶尔会拿些专业问题来忽悠那些非计算机专业的同学。今天测试组开完会后,他又发话了:在古老的一维模式识别中,常常需要计算连续子向量的最大和,当向量全为正数的时候,问题很好解决。但是,如果向量中包含负数,是否应该包含某个负数,并期望旁边的正数会弥补它呢？例如:{6,-3,-2,7,-15,1,2,2},连续子向量的最大和为8(从第0个开始,到第3个为止)。给一个数组，返回它的最大连续子序...

2018-09-16 14:33:33 97

原创剑指Offer-构建乘积数组

题目描述给定一个数组A[0,1,...,n-1],请构建一个数组B[0,1,...,n-1],其中B中的元素B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]。不能使用除法。import java.util.ArrayList;public class Solution { public int[] multiply(int[] A) { ...

2018-09-16 14:12:53 132

原创剑指Offer-矩形覆盖

题目描述我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？//递归public class Solution { public int RectCover(int target) { if(target<=0){ return 0; }el...

2018-09-16 13:36:29 85

原创剑指Offer-变态跳台阶

题目描述一只青蛙一次可以跳上1级台阶，也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。public class Solution { public int JumpFloorII(int target) { if(target<=0) return 0; return 1<<(t...

2018-09-16 13:33:39 92

原创剑指Offer-跳台阶

题目描述一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法（先后次序不同算不同的结果）。public class Solution { public int JumpFloor(int target) { if(target<1){ return -1; }else if(targ...

2018-09-16 13:29:32 84

原创剑指offer-斐波那契序列（循环，不用递归）

题目描述大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项（从0开始，第0项为0）。n<=39public class Solution { public int Fibonacci(int n) { int preNum=1; int prePreNum=0; int result=0; ...

2018-09-16 13:19:59 284

原创剑指offer-斐波那契数列

题目描述大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项（从0开始，第0项为0）。n<=39public class Solution { public int Fibonacci(int n) { if(n<=0){ return 0; }else if(n==...

2018-09-16 13:03:48 83

原创剑指Offer-二叉树的深度

题目描述输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。/**public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { ...

2018-09-16 12:58:12 104

原创 Kotlin-面向对象

5.1面向对象的基本概念5.5.1类类是由属性和方法组成的，类是面向对象的核心和基础，可以将相似的对象封装在一个类中5.1.2对象对象是类的实例化，创建一个对象表示实例化一个类只有创建对象，才可以使用类的属性和方法5.1.3面向对象的三大特性封装，继承和多态1、封装，是指把类的使用和实现分开，只保留有限的接口给外部使用。封装只留给开发者一个访问对象的接口，使开发...

2018-08-22 17:26:01 340

原创 Kotlin-函数

4.1 模块化程序设计独立模块由顺序、分支和循环着三种基本结构组成，其特点主要表现在主程序与独立模块之间的数据输入和输出。即主程序与模块函数之间的数据传递//计算1!+2!+3!+4!+....+7!+8!fun sum( n:Int) :Double{ var i=1 var s:Double=0.0 do{ s=s+ fac(i) ...

2018-08-22 14:03:35 197

原创 Kotlin-集合

3.1集合只读List集合//使用listOf创建list集合fun main(args:Array<String>){ val device1= listOf("显示器","键盘","鼠标","主机") val device2=listOf("联想笔记本","戴尔笔记本","外星人笔记本") val de

2018-08-22 13:39:59 232

原创 kotlin-流程控制语句

2.5.1条件语句（if和when)2.5.2循环语句2.5.2.1for2.5.2.2while2.5.2.3do...while2.6跳转语句returnbreakcontinue

2018-08-21 15:55:29 135

原创 Kotlin-运算符

2.4.1算术运算符 fun main(args:Array<String>){ val a=10 if(a is Int){ println(a) } if(a!is Int){ println(a) } val b: String?=a as? String println(b) ...

2018-08-21 15:52:09 217

原创 Kotlin-编程基础

2.1编程风格1、驼峰命名法，不使用下划线。例如 public class DataBaseUser2、类的首字母要大写class People3、方法和属性名的首字母要小写fun hello(){} 2.2 Kotlin常量和变量常量：val 变量:: var2.2.1常量val constrain1=3.3val constrain3:...

2018-08-21 15:49:28 210

原创 Kotlin-启程

参考:https://juejin.im/entry/5893ff2f8d6d81006c4a9565/detail?utm_source=awesome_kotlin&amp%3Butm_medium=jjzl

2018-08-19 20:09:07 120

原创第一个Kotlin程序

开发环境:IJfun main(args:Array<String>){ println("Hello World!")}

2018-08-19 19:22:23 199

原创华为机试_数字颠倒

import java.util.*;public class huawei_1004 { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int a=sc.nextInt(); String str=String.valueOf(a); String reve...

2018-08-11 03:13:20 152

原创华为机试_句子逆序

import java.util.*;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); String str=sc.nextLine(); String[] ans=str.split(" "); for(int i=ans.le...

2018-08-11 03:05:06 293

原创华为机试_计算字符个数

import java.util.*;public class huawei_1002 { public static void main(String[] args) { Scanner sc=new Scanner(System.in); String str=sc.next(); String re=sc.next(); int ans=0; for(int...

2018-08-11 02:36:14 179

原创华为机试在线训练_字符串反转

题目描述写出一个程序，接受一个字符串，然后输出该字符串反转后的字符串。例如：输入描述: 输入N个字符输出描述: 输出该字符串反转后的字符串示例1输入复制abcd输出复制dcba import java.util.*;public class Main{ public static void main(String[...

2018-08-11 02:16:09 268

原创 PAT乙级_1002 写出这个数 (20)

Python解法1：numbers = input()sum = 0for number in numbers: sum = sum + int(number)strsums = str(sum)info = []for strsum in strsums: if strsum == '1': info.append("yi") elif s...

2018-08-09 23:36:31 137

原创 PAT乙级_1001 害死人不偿命的(3n+1)猜想 JAVA&Python

卡拉兹(Callatz)猜想：对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把(3n+1)砍掉一半。这样一直反复砍下去，最后一定在某一步得到n=1。卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时耶鲁大学师生齐动员，拼命想证明这个貌似很傻很天真的命题，结果闹得学生们无心学业，一心只证(3n+1)，以至于有人说这是一个阴谋，卡拉兹是在蓄意延缓美国数学界教学与科...

2018-08-09 22:54:36 149

原创 HDOJ 1003 JAVA

import java.util.*;import java.math.*;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextIn

2017-12-28 01:52:27 394

原创 HDOJ 1002 JAVA

import java.util.*;import java.math.*;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n; n=s

2017-12-28 01:51:39 278

原创 HDOJ 1001 JAVA

import java.util.*;import java.math.*;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextIn

2017-12-28 01:50:53 366

原创 HDOJ 1000 JAVA

import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int a=sc.nextInt();

2017-12-28 01:50:02 251

Fluorescence Microscopy Image Segmentation....

作者：Chichen Fu,Soonam Lee,David Joon Ho,Shuo Han,Paul Salama,Kenneth W. Dunn,Edward J. Delp 摘要：Recent advance in fluorescence microscopy enables acquisition of 3D image volumes with better quality and deeper penetration into tissue. Segmentation is a required step to characterize and analyze biological structures in the images. 3D segmentation using deep learning has achieved promising results in microscopy images. One issue is that deep learning techniques require a large set of groundtruth data which is impractical to annotate manually for microscopy volumes. This paper describes a 3D nuclei segmentation method using 3D convolutional neural networks. A set of synthetic volumes and the corresponding groundtruth volumes are generated automatically using a generative adversarial network. Segmentation results demonstrate that our proposed method is capable of segmenting nuclei successfully in 3D for various data sets.

2018-02-08

Deep Learning Graph-based 3DSegmentationofPancreaticTumorsonCTscans

作者：Zhihui Guo,Ling Zhang,Le Lu,Mohammadhadi Bagheri,Ronald M. Summers,Milan Sonka,Jianhua Yao 摘要：This paper reports Deep LOGISMOS approach to 3D tumor segmentation by incorporating boundary information derived from deep contextual learning to LOGISMOS - layered optimal graph image segmentation of multiple objects and surfaces. Accurate and reliable tumor segmentation is essential to tumor growth analysis and treatment selection. A fully convolutional network (FCN), UNet, is first trained using three adjacent 2D patches centered at the tumor, providing contextual UNet segmentation and probability map for each 2D patch. The UNet segmentation is then refined by Gaussian Mixture Model (GMM) and morphological operations. The refined UNet segmentation is used to provide the initial shape boundary to build a segmentation graph. The cost for each node of the graph is determined by the UNet probability maps. Finally, a max-flow algorithm is employed to find the globally optimal solution thus obtaining the final segmentation. For evaluation, we applied the method to pancreatic tumor segmentation on a dataset of 51 CT scans, among which 30 scans were used for training and 21 for testing. With Deep LOGISMOS, DICE Similarity Coefficient (DSC) and Relative Volume Difference (RVD) reached 83.2+-7.8% and 18.6+-17.4% respectively, both are significantly improved (p<0.05) compared with contextual UNet and/or LOGISMOS alone.

2018-02-08

Mix-and-Match Tuning for Self-Supervised Semantic Segmentation

作者：Xiaohang Zhan,Ziwei Liu,Ping Luo,Xiaoou Tang,Chen Change Loy 摘要：Deep convolutional networks for semantic image segmentation typically require large-scale labeled data, e.g. ImageNet and MS COCO, for network pre-training. To reduce annotation efforts, self-supervised semantic segmentation is recently proposed to pre-train a network without any human-provided labels. The key of this new form of learning is to design a proxy task (e.g. image colorization), from which a discriminative loss can be formulated on unlabeled data. Many proxy tasks, however, lack the critical supervision signals that could induce discriminative representation for the target image segmentation task. Thus self-supervision's performance is still far from that of supervised pre-training. In this study, we overcome this limitation by incorporating a "mix-and-match" (M&M) tuning stage in the self-supervision pipeline. The proposed approach is readily pluggable to many self-supervision methods and does not use more annotated samples than the original process. Yet, it is capable of boosting the performance of target image segmentation task to surpass fully-supervised pre-trained counterpart. The improvement is made possible by better harnessing the limited pixel-wise annotations in the target dataset. Specifically, we first introduce the "mix" stage, which sparsely samples and mixes patches from the target set to reflect rich and diverse local patch statistics of target images. A "match" stage then forms a class-wise connected graph, which can be used to derive a strong triplet-based discriminative loss for fine-tuning the network. Our paradigm follows the standard practice in existing self-supervised studies and no extra data or label is required. With the proposed M&M approach, for the first time, a self-supervision method can achieve comparable or even better performance compared to its ImageNet pre-trained counterpart on both PASCAL VOC2012 dataset and CityScapes dataset.

2018-02-08

An Iterative Spanning Forest Framework for Superpixel Segmentation

作者：John E. Vargas-Muñoz,Ananda S. Chowdhury,Eduardo B. Alexandre,Felipe L. Galvão,Paulo A. Vechiatto Miranda,Alexandre X. Falcão 摘要：Superpixel segmentation has become an important research problem in image processing. In this paper, we propose an Iterative Spanning Forest (ISF) framework, based on sequences of Image Foresting Transforms, where one can choose i) a seed sampling strategy, ii) a connectivity function, iii) an adjacency relation, and iv) a seed pixel recomputation procedure to generate improved sets of connected superpixels (supervoxels in 3D) per iteration. The superpixels in ISF structurally correspond to spanning trees rooted at those seeds. We present five ISF methods to illustrate different choices of its components. These methods are compared with approaches from the state-of-the-art in effectiveness and efficiency. The experiments involve 2D and 3D datasets with distinct characteristics, and a high level application, named sky image segmentation. The theoretical properties of ISF are demonstrated in the supplementary material and the results show that some of its methods are competitive with or superior to the best baselines in effectiveness and efficiency.

2018-02-08

Improved Image Segmentation via Cost Minimization of Multiple Hypotheses

作者：Marc Bosch,Christopher M. Gifford,Austin G. Dress,Clare W. Lau,Jeffrey G. Skibo,Gordon A. Christie 摘要：Image segmentation is an important component of many image understanding systems. It aims to group pixels in a spatially and perceptually coherent manner. Typically, these algorithms have a collection of parameters that control the degree of over-segmentation produced. It still remains a challenge to properly select such parameters for human-like perceptual grouping. In this work, we exploit the diversity of segments produced by different choices of parameters. We scan the segmentation parameter space and generate a collection of image segmentation hypotheses (from highly over-segmented to under-segmented). These are fed into a cost minimization framework that produces the final segmentation by selecting segments that: (1) better describe the natural contours of the image, and (2) are more stable and persistent among all the segmentation hypotheses. We compare our algorithm's performance with state-of-the-art algorithms, showing that we can achieve improved results. We also show that our framework is robust to the choice of segmentation kernel that produces the initial set of hypotheses.

2018-02-08

Tensorflow教程，斯坦福大学

Tensorflow教程，有ppt和课件，还有考试作业。视频可以自己网上找。

2017-12-25

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人