load 'viewmat'
]B=:A*.|.A*.|.A=:-.(500+x)mailto:programming-boun...@forums.jsoftware.com] On Behalf
Of Brian Schott
Sent: Tuesday, June 27, 2017 2:04 PM
To: Programming forum
Subject: Re: [Jprogramming] cleanest diamond
Marshall,
There are 2 images in this "conversation": im1 and im2.
If I app
Can you get the C source and compile it for 64 bit and other platforms and then
release it as a j805 addons?
Sent from my iPhone
On 28 Jun, 2017, at 12:44 AM, David Mitchell wrote:
> Jon, that would probably be the simplest way to get the addons.
>
> All the best,
> David
>
> On 6/27/2017 11
I see how (#/.~@])`(~.@])`[}is an inverse of monad I., but I don't see
how it is a left inverse of (presumably dyad) I. . Please explain.
Also, it would be a problem to have a dyadic inverse of a monad, no?
Duals wouldn't work. Changing the suggestion to
(#/.~)`~.`(0#~>:@(>./))}
would add
Marshall,
That clarifies a great deal to me.
It is fast and implements well.
It seems to give almost the same recommendation for all 4 suits, too.
Thanks, very much.
On Tue, Jun 27, 2017 at 2:29 PM, Marshall Lochbaum
wrote:
> My answer was intended to help you find the optimal threshold to use
Hopefully running the functions on the initial image of intensities
rather than a thresholded image will help explain somewhat. My
explanation was a bit rushed as I wrote it before work, but I can
continue to clarify if you run into problems.
The issue with a global minimum is a well-known problem
806 beta-4 available
Some comments from original announcement are repeated here for emphasis.
806 will be primarily a performance release. This is the first J release
where hardware features are directly used for performance. Previous
releases depended on excellent code and smart algorithms. With
My answer was intended to help you find the optimal threshold to use.
You are trying to interpret it as a way to measure how good a given
threshold is. It turns out that the computations you did contain that
information, but my method is much faster than checking each individual
threshold.
The inp
Marshall,
There are 2 images in this "conversation": im1 and im2.
If I apply your code for finding pairs of adjacent pixels on these 2 images
I get the following results. Can you elaborate on the meaning and
meaningfulness of the results below, please?
$((}. ,.&, }:) , (}."1 ,.&, }:"1))im1
150
Marshall,
I am having some difficulty getting my head around your comments involving
interval lists. I am still processing your ideas because I don't see how to
put them into a strategy that deals with my diamonds.
On the other hand, one of your comments regarding "Just picking the minimum
won't
especially, but not only, Marshall, Markus, and Ben
Regarding closures, I am not seeing their benefit unless the calculation of
closures is more efficient, because in my case the need is to compare the
results of various image closures (or various image contigmds) not for
producing the closure its
Jon, that would probably be the simplest way to get the addons.
All the best,
David
On 6/27/2017 11:50, 'Jon Hough' via Programming wrote:
Thanks David. I will take a look. Do I need to install j602 for this?
Regards,
Jon
On Jun 27, 2017, 23:59, at 23:59, David Mitchell wrote:
There should
That looks great. I noticed it is MIT licensed, so I hope you wont mind if I
use this in my project.
Regards
Jon
On Jun 28, 2017, 00:19, at 00:19, Xiao-Yong Jin wrote:
>I have ported an LBFGS minimizer from a C implementation.
>
>https://gist.github.com/jxy/9db97e44708d0946c3da2d7e82fefcd0
>
>>
Thanks David. I will take a look. Do I need to install j602 for this?
Regards,
Jon
On Jun 27, 2017, 23:59, at 23:59, David Mitchell wrote:
>There should be a 32 bit version in \addons\math\lbfgs for j602. I
>copied the
>directory and contents to \addons\math\lbfgs for j805 and it seemed to
>w
I have ported an LBFGS minimizer from a C implementation.
https://gist.github.com/jxy/9db97e44708d0946c3da2d7e82fefcd0
> On Jun 27, 2017, at 9:59 AM, David Mitchell wrote:
>
> There should be a 32 bit version in \addons\math\lbfgs for j602. I copied
> the directory and contents to \addons\mat
Apparently something goes different at your place. Here:
$im1
30 26
That is, after I did:
im1 =: _48+ (, ;._2) a. i. 0 : 0
00
00
00
00
001000
011100
There should be a 32 bit version in \addons\math\lbfgs for j602. I copied the
directory and contents to \addons\math\lbfgs for j805 and it seemed to work ok,
after removing:
script_z_ '~system\main\dll.ijs'
Let me know if this works for you.
All the best,
David Mitchell
On 6/27/2017 10:38,
im1
Specifically, what is the shape of im1?
Thanks,
--
Raul
On Tue, Jun 27, 2017 at 10:48 AM, Linda Alvord wrote:
> Here's what I enter and there is no result. What am I missing?
> It is an interesting result.
>
> Linda
>
> -Original Message-
> From: Programming [mailto:programming-b
Here's what I enter and there is no result. What am I missing?
It is an interesting result.
Linda
-Original Message-
From: Programming [mailto:programming-boun...@forums.jsoftware.com] On Behalf
Of Ben Gorte - CITG
Sent: Tuesday, June 27, 2017 8:42 AM
To: programm...@jsoftware.com
Subje
Hi Linda,
Did you define the image im1 using Markus's command?
You have to copy-paste those lines into an edit window, up to and including the
) at the bottom line,
and execute it.
im1 =: _48+ (, ;._2) a. i. 0 : 0
00
00
00
I was wondering whether the math addons contained an implementation of the
LBFGS algorithm. I couldn't find anything, except this cryptic
entry in the wiki:
http://code.jsoftware.com/wiki/Addons/math/lbfgs
Looking through the math addon files I couldn't find anything resembling this.
Does such an
What am I missing. There is no result for this code. It seems like and
interesting result.
Linda
g-Original Message-
From: Programming [mailto:programming-boun...@forums.jsoftware.com] On Behalf
Of Ben Gorte - CITG
Sent: Tuesday, June 27, 2017 8:42 AM
To: programm...@jsoftware.com
Sub
I was thinking about closing too, but a little bit slower than Markus,
show =: (-.&' ')"1 @: ":
expand =: 3 : '(,.~{."1)(,.{:"1)(,~{.)(,{:) y'
minf =: 3 : '3 3 <./@:, ;. _3 expand y'
maxf =: 3 : '3 3 >./@:, ;. _3 expand y'
(show im1);show minf maxf im1
+-
A morphological closure is the reasonable treating.
With these definitions:
im1 =: _48+ (, ;._2) a. i. 0 : 0
00
00
00
00
001000
011100
0111
A common strategy that may work for you is just to ignore the spacial
data and perform some sort of clustering (like k-means, with k=2) on the
intensities. Then classify pixels according to which cluster they fall
in.
An approach that does use this data, and which I expect would be much
slower but
Chat really...
Breakfast-time again! Noticing my name (below) I assumed you meant my
recent discussions
with Raul et al on "the largest rectangle problem" were relevant! On
checking, I see that I
had contributed something years ago, on colouring contiguous areas in
rectangles.
So perhaps I'
25 matches
Mail list logo
